Erratum: Construction of new extremal self-dual codes (Discrete Mathematics (2003) 263 (81-91) DOI: 10.1016/S0012-365X(02)00570-8);Construction of new extremal self-dual codes

Discrete Mathematics

Volumn 263, Issue 1-3, 2003, Pages 81-91

  Gulliver, T Aaron ^a   Harada, Masaaki ^b   Kim, Jon Lark ^c  

^a UNIVERSITY OF VICTORIA   (Canada)

^b YAMAGATA UNIVERSITY   (Japan)

^c UNIVERSITY OF ILLINOIS AT CHICAGO   (United States)

Author keywords

Binary self dual codes; Extremal codes

Indexed keywords

EID: 84867940167     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disc.2004.10.001     Document Type: Erratum

References (22)

1. E.F. Assmus Jr., V. Pless, On the covering radius of extremal self-dual codes, IEEE Trans. Inform. Theory 29 (1983) 359-363.
2. A. Baartmans, V. Yorgov, Some new extremal codes oflengths 76 and 78, in: Proceedings ofthe Seventh International Workshop on Algebra and Combinatorial Coding Theory, 18-24 June, 2000, Bulgaria, pp. 51-54.
3. K. Betsumiya, T.A. Gulliver, M. Harada, A. Munemasa, On Type II codes over F4, IEEE Trans. Inform. Theory 47 (2001) 2242-2248.
4. S. Bouyuklieva, private communication, August 17, 2000.
5. R. Brualdi, V. Pless, Weight enumerators of self-dual codes, IEEE Trans. Inform. Theory 37 (1991) 1222-1225.
6. J.H. Conway, N.J.A. Sloane, A new upper bound on the minimal distance ofself-dual codes, IEEE Trans. Inform. Theory 36 (1990) 1319-1333.
7. R. Dontcheva, M. Harada, Some extremal self-dual codes with an automorphism of order 7, submitted for publication.
8. R. Dontcheva, M. Harada, Extremal doubly-even [80; 40; 16] codes with an automorphism oforder 19, submitted for publication.
9. S.T. Dougherty, T.A. Gulliver, M. Harada, Extremal binary self-dual codes, IEEE Trans. Inform. Theory 43 (1997) 2036-2047.
10. T.A. Gulliver, M. Harada, Weight enumerators ofdouble circulant codes and new extremal self-dual codes, Design Codes Crypt. 11 (1997) 141-150.
11. M. Harada, Existence ofnew extremal doubly-even codes and extremal singly-even codes, Design Codes Crypt. 8 (1996) 273-283.
12. M. Harada, The existence ofa self-dual [70; 35; 12] code and formally self-dual codes, Finite Fields Appl. 3 (1997) 131-139.
13. M. Harada, New extremal ternary self-dual codes, Austral. J. Combin. 17 (1998) 133-145.
14. M. Harada, H. Kimura, On extremal self-dual codes, Math. J. Okayama Univ. 37 (1995) 1-14.
15. S.N. Kapralov, V.D. Tonchev, Extremal doubly-even codes oflength 64 derived from symmetric designs, Discrete Math. 83 (1990) 285-289.
16. J.-L. Kim, New extremal self-dual codes of lengths 36, 38, and 58, IEEE Trans. Inform. Theory 47 (2001) 386-393.
17. F.J. MacWilliams, N.J.A. Sloane, The Theory ofError-Correcting Codes, North-Holland, Amsterdam, 1977.
18. A. Otmani, A new construction ofself-dual codes, in: Proceedings ofthe Seventh International Workshop on Algebra and Combinatorial Coding Theory, 18-24 June, 2000, Bulgaria, pp. 255-260.
19. M. Ozeki, Note on the shadow process in coding theory, preprint, November 2000.
20. V. Pless, N.J.A. Sloane, On the classi=cation and enumeration ofself-dual codes, J. Combin. Theory Ser. A 18 (1975) 313-335.
21. E.M. Rains, Shadow bounds for self-dual codes, IEEE Trans. Inform. Theory 44 (1998) 134-139.
22. S. Topalova, Classi=cation ofHadamard matrices oforder 44 with automorphisms oforder 7, in: Proceedings ofthe Seventh International Workshop on Algebra and Combinational Coding Theory, 18-24 June, 2000, Bulgaria, pp. 305-310.