New bounds for the minimum length of quaternary linear codes of dimension five
- 15 May 1997
- journal article
- research article
- Published by Elsevier in Discrete Mathematics
- Vol. 169 (1-3) , 185-192
- https://doi.org/10.1016/s0012-365x(96)00104-5
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Optimal quaternary linear codes of dimension fiveIEEE Transactions on Information Theory, 1996
- New good rate (m-1)/pm ternary and quaternary quasi-cyclic codesDesigns, Codes and Cryptography, 1996
- The nonexistence of some five-dimensional quaternary linear codesIEEE Transactions on Information Theory, 1995
- Optimal linear codes over GF(4)Discrete Mathematics, 1994
- On the construction of [q 4 + q 2 ? q, 5,q 4 ? q 3 + q 2 ? 2q; q]-codes meeting the Griesmer boundDesigns, Codes and Cryptography, 1992
- Some best rate 1/p and rate (p-1)/p systematic quasi-cyclic codes over GF(3) and GF(4)IEEE Transactions on Information Theory, 1992
- Optimal ternary linear codesDesigns, Codes and Cryptography, 1992
- Some ternary and quaternary codes and associated sphere packingsIEEE Transactions on Information Theory, 1992
- The Geometry of Two-Weight CodesBulletin of the London Mathematical Society, 1986
- A Bound for Error-Correcting CodesIBM Journal of Research and Development, 1960