New bounds for n4(k,d) and classification of some optimal codes over GF(4)
- 1 April 2004
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 281 (1-3) , 43-66
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- Some new results for optimal ternary linear codesIEEE Transactions on Information Theory, 2002
- The smallest length of eight-dimensional binary linear codes with prescribed minimum distanceIEEE Transactions on Information Theory, 2000
- 41 is the Largest Size of a Cap in PG(4,4)Designs, Codes and Cryptography, 1999
- Codes and Projective MultisetsThe Electronic Journal of Combinatorics, 1998
- The Magma Algebra System I: The User LanguageJournal of Symbolic Computation, 1997
- The Correspondence Between Projective Codes and 2-weight CodesDesigns, Codes and Cryptography, 1997
- Optimal quaternary linear codes of dimension fiveIEEE Transactions on Information Theory, 1996
- The nonexistence of some five-dimensional quaternary linear codesIEEE Transactions on Information Theory, 1995
- Optimum codes of dimension 3 and 4 over GF(4)IEEE Transactions on Information Theory, 1992
- A note on the Griesmer bound (Corresp.)IEEE Transactions on Information Theory, 1973