Extremal self-dual codes with the smallest covering radius

Discrete Mathematics

Volumn 215, Issue 1-3, 2000, Pages 271-281

  Harada, Masaaki ^a   Ozeki, Michio ^a  

^a YAMAGATA UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0009065096     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(99)00318-0     Document Type: Article

References (19)

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. R.A. Brualdi, V.S. Pless, Weight enumerators of self-dual codes, IEEE Trans. Inform. Theory 37 (1991) 1222-1225.
3. R.A. Brualdi, V.S. Pless, R.M. Wilson, Short codes with a given covering radius, IEEE Trans. Inform. Theory 35 (1989) 99-109.
4. F.C. Bussemaker, V.D. Tonchev, Extremal doubly-even codes of length 40 derived from Hadamard matrices of order 20, Discrete Math. 82 (1990) 317-321.
5. G.D. Cohen, M.G. Karpovsky, H.F. Mattson Jr., J.R. Schatz, Covering radius - survey and recent results, IEEE Trans. Inform. Theory 31 (1985) 328-343.
6. J.H. Conway, V. Pless, N.J.A. Sloane, The binary self-dual codes of length up to 32: a revised enumeration, J. Combin. Theory Ser. A 60 (1992) 183-195.
7. J.H. Conway, N.J.A. Sloane, A new upper bound on the minimal distance of self-dual codes, IEEE Trans. Inform. Theory 36 (1990) 1319-1333.
8. P. Delsarte, Four fundamental parameters of a code and their combinatorial significance, Inform. Control 23 (1973) 407-438.
9. R.L. Graham, N.J.A. Sloane, On the covering radius of codes, IEEE Trans. Inform. Theory 31 (1985) 385-401.
10. M. Harada, Existence of new extremal doubly-even codes and extremal singly-even codes, Des. Codes Cryptogr. 8 (1996) 273-283.
11. M. Harada, T.A. Gulliver, H. Kaneta, Classification of extremal double circulant self-dual codes of length up to 62, Discrete Math. 188 (1998) 127-136.
12. A. Lobstein, V. Pless, The length function: a revised table, Lecture Notes in Comput. Sci., Vol. 781, 1994, pp. 51-55.
13. M. Ozeki, Hadamard matrices and doubly even self-dual error-correcting codes, J. Combin. Theory Ser. A 44 (1987) 274-287.
14. M. Ozeki, On covering radii and coset weight distributions of extremal binary self-dual codes of length 40, Theoret. Comput. Sci. 235 (2000) 283-308.
15. M. Ozeki, Two results on the covering radius problem for binary self-dual codes, preprint.
16. R. Struik, An improvement of the Van Wee bound for binary linear covering codes, IEEE Trans. Inform. Theory 40 (1994) 1280-1284.
17. V.D. Tonchev, Self-orthogonal designs and extremal doubly-even codes, J. Combin. Theory Ser. A 52 (1989) 197-205.
18. V. Yorgov, R. Ruseva, Two extremal codes of length 42 and 44, (in Russian) Problem. Perda. Inform. 29 (1993) 99-103. English translation in: Problem. Inform. Trans. 29 (1994) 385-388.
19. V. Yorgov, R. Ruseva, Two extremal codes of length 42 and 44, (in Russian) Problem. Perda. Inform. 29 (1993) 99-103. English translation in: Problem. Inform. Trans. 29 (1994) 385-388.