New Extremal Type I Codes of Lengths 40, 42, and 44

Designs, Codes, and Cryptography

Volumn 30, Issue 2, 2003, Pages 151-157

  Dalan, Daniel B ^a  

^a KYUSHU UNIVERSITY   (Japan)

Author keywords

Extremal Type I codes

Indexed keywords

ALGORITHMS; MATRIX ALGEBRA; THEOREM PROVING; VECTORS;

WEIGHT ENUMERATORS;

CODES (SYMBOLS);

EID: 0141958746     PISSN: 09251022     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1025476619824     Document Type: Article

References (27)

1. R. A. Brualdi and V. S. Pless, Weight enumerators of self-dual codes, IEEE Trans. Inform. Theory, Vol. 37 (1991) pp. 1222-1225.
2. I. Boukliev and S. Buyuklieva, Some new extremal self-dual codes with lengths 44, 50, 54, and 58, IEEE Trans. Inform. Theory, Vol. 44 (1998) pp. 809-812.
3. S. Buyuklieva, A method for constructing self-dual codes with an automorphism of order 2, IEEE Trans. Inform. Theory, Vol. 46 (2000) pp. 496-504.
4. S. Buyuklieva, New extremal self-dual codes of lengths 42 and 44, IEEE Trans. Inform. Theory, Vol. (43) (1997) pp. 1607-1612.
5. S. Buyuklieva, On the binary self-dual codes with an automorphism of order 2, Des. Codes Cryptogr., Vol. 12 (1997) pp. 39-48.
6. S. Buyuklieva and V. Yorgov, Singly even self-dual codes of length 40, Des. Codes Cryptogr., Vol. 9 (1996) pp. 131-141.
7. F. C. Bussemaker and V. D. Tonchev, New extremal doubly-even codes of length 40 derived from Hadamard matrices of order 20, Discrete Math., Vol. 82 (1990) pp. 317-321.
8. J. H. Conway and N. J. A. Sloane, A new upper bound on the minimal distance of self-dual codes, IEEE Trans. Inform. Theory, Vol. 36 (1990) pp. 1319-1333.
9. D. B. Dalan, Type I neighbors of extremal Type II codes of length 40 derived from Hadamard matrices, submitted.
10. S. T. Dougherty, T. A. Gulliver and M. Harada, Extremal binary self-dual codes, IEEE Trans. Inform. Theory, Vol. 43 (1997) pp. 2036-2047.
11. M. Harada, Existence of new extremal doubly-even codes and extremal singly-even codes, Des. Codes Cryptogr., Vol. (8) (1996) pp. 1-12.
12. M. Harada, Existence of new extremal doubly-even and self-dual codes, Des. Codes Cryptogr., Vol. 8 (1996) pp. 273-283.
13. M. Harada, Weighing matrices and self-dual codes, Ars Combin., Vol. 47 (1997) pp. 65-73.
14. M. Harada, The existence of a self-dual [70, 35, 12] code and formally self-dual codes, Finite Fields Appl., Vol. 3 (1997) pp. 131-139.
15. M. Harada, T. A. Gulliver and H. Kaneta, Classification of extremal double circulant self-dual codes of length up to 62, Discrete Math., Vol. 188 (1998) pp. 127-136.
16. M. Harada and H. Kimura, On extremal self-dual codes, Math. J. Okayama Univ., Vol. 37 (1995) pp. 1-14.
17. M. Harada and V. D. Tonchev, Self-dual singly-even codes and Hadamard matrices, In Lecture Notes in Computer Science, Proc. AAECC 11. no. 948, Springer-Verlag, New York (1995) pp. 279-284.
18. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-correcting Codes, North-Holland, New York (1977).
19. C. L. Mallows and N. J. A. Sloane, An upper bound for self-dual codes, Inform, and Control, Vol. 22 (1973) pp. 188-200.
20. E. Rains, Shadow bounds for self-dual codes, IEEE Trans. Inform. Theory, Vol. 44 (1998) pp. 134-139.
21. R. Ruseva and V. Y. Yorgov, Two extremal codes of length 42 and 44, Probl. Pered. Inform., Vol. 29 (1993) pp. 99-103 (in Russian).
22. E. Rains and N. J. A Sloane, Self-dual codes, In (V. S. Pless and W. C. Huffman, eds.), Handbook of Coding Theory, Elsevier, Amsterdam (1998).
23. E. Spence, Symmetric (41,16,6)-designs with a nontrivial automorphism of odd order, J. Comb. Designs, Vol. 1 (1993) pp. 193-211.
24. E. Spence and V. D. Tonchev, Extremal self-dual codes from symmetric designs, Discrete Math, Vol. 110 (1992) pp. 265-268.
25. H.-P. Tsai, Existence of certain extremal self-dual codes, IEEE Trans. Inform. Theory, Vol. 38 (1992) pp. 501-504.
26. V. Y. Yorgov, The extremal codes of length 42 with automorphism of order 7, Discrete Math., Vol. 190 (1998) pp. 201-213.
27. V. Y. Yorgov, New extremal singly-even self-dual codes of length 44, In Proceedings of 6th Joint Swedish-Russian Int, Workshop on Information Theory, Mölle, Sweden (1993) pp. 372-375.