On binary extremal formally self-dual even codes

Kyushu Journal of Mathematics

Volumn 53, Issue 2, 1999, Pages 421-430

  Betsumiya, Koichi ^a   Gulliver, T Aaron ^b   Harada, Masaaki ^c  

^a NAGOYA UNIVERSITY   (Japan)

^b UNIVERSITY OF CANTERBURY   (New Zealand)

^c YAMAGATA UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85013172819     PISSN: 13406116     EISSN: None     Source Type: Journal    
DOI: 10.2206/kyushujm.53.421     Document Type: Article

References (12)

1. C. Bachoc. Application of coding theory to the construction of modular lattices. J. Combin. Theory Ser. A. 78 (1997), 92-119.
2. C. Bachoc. On harmonic weight enumerators of binary codes. Designs, Codes and Cryptography, to appear.
3. A. E. Brouwer. Linear code bound (server). Eindhoven University of Technology, The Netherlands.
4. J. H. Conway and N. J. A. Sloane. An upper bound on the minimum distance of self-dual codes. IEEE Trans. Inform. Theory 36 (1990), 1319-1333.
5. S. T. Dougherty, P. Gaborit, M. Harada and P. Solé. Type II codes over F2 + u F2. IEEE Trans. Inform. Theory 45(1999), 32-45.
6. J. E. Fields, P. Gaborit, W. C. Huffman and V. Pless. On the classification of extremal even formally self-dual codes. Preprint, June 1998.
7. T. A. Gulliver and M. Harada. Classification of extremal double circulant formally self-dual even codes. Des. Codes and Cryptogr. 11 (1997), 25-35.
8. D. B. Jaffe. Optimal binary linear codes of length ≤ 30. Discrete Math., to appear.
9. G. T. Kennedy and V. Pless. On designs and formally self-dual codes. Des. Codes and Cryptogr. 4 (1994), 43-55.
10. C. L. Mallows and N. J. A. Sloane. An upper bound for self-dual codes. Inform. Control. 22 (1973), 188-200.
11. V. Pless. A classification of self-orthogonal codes over GF(2). Discrete Math. 3 (1972), 209-249.
12. J. Simonis. The [18, 9, 6] code is unique. Discrete Math. 106/107 (1992), 439-448.