Optimal ternary linear codes
- 1 June 1992
- journal article
- research article
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 2 (2) , 137-157
- https://doi.org/10.1007/bf00124893
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Optimal ternary quasi-cyclic codesDesigns, Codes and Cryptography, 1992
- A survey of recent works with respect to a characterization of an (n, k, d; q)-code meeting the Griesmer bound using a min·hyper in a finite projective geometryDiscrete Mathematics, 1989
- New bounds on binary linear codes of dimension eight (Corresp.)IEEE Transactions on Information Theory, 1987
- An updated table of minimum-distance bounds for binary linear codesIEEE Transactions on Information Theory, 1987
- The packing problem for projective geometries over GF(3) with dimension greater than fiveJournal of Combinatorial Theory, Series A, 1983
- The smallest length of binary 7–dimensional linear codes with prescribed minimum distanceDiscrete Mathematics, 1981
- Caps and codesDiscrete Mathematics, 1978
- Minimum-distance bounds for binary linear codesIEEE Transactions on Information Theory, 1973
- Linear binary anticodesElectronics Letters, 1970
- Algebraically punctured cyclic codesInformation and Control, 1965