Shadow optimal self-dual codes

Kyushu Journal of Mathematics

Volumn 53, Issue 2, 1999, Pages 223-237

  Dougherty, Steven T ^a   Harada, Masaaki ^b  

^a UNIVERSITY OF SCRANTON   (United States)

^b YAMAGATA UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (18)

1. A. E. Brouwer and T. Verhoeff, An updated table of minimum-distance bounds for binary linear codes. IEEE Trans. Inform. Theory 39 (1993), 662-677.
2. R. A. Brualdi and V. S. Pless, Weight enumerators of self-dual codes. IEEE Trans. Inform. Theory 37 (1991), 1222-1225.
3. J. H. Conway and N. J. A. Sloane, A new upper bound on the minimal distance of self-dual codes. IEEE Trans. Inform. Theory 36 (1990), 1319-1333.
4. S. T. Dougherty, Shadow codes and weight enumerators. IEEE Trans. Inform. Theory 41 (1995), 762-768.
5. S. T. Dougherty and M. Harada, New extremal self-dual codes of length 68. IEEE Trans. Inform. Theory, to appear.
6. T. A. Gulliver and M. Harada, Weight enumerators of double circulant codes and new extremal self-dual codes. Des. Codes and Cryptogr. 11 (1997), 141-150.
7. T. A. Gulliver and M. Harada, Classification of extremal double circulant self-dual codes of lengths 64 to 72. Des. Codes and Cryptogr. 13 (1998), 257-269.
8. M. Harada, Existence of new extremal doubly-even codes and extremal singly-even codes. Des. Codes and Cryptogr. 8 (1996), 273-283.
9. M. Harada, The existence of a self-dual [70, 35, 12] code and formally self-dual codes. Finite Fields and Their Appl. 3 (1997), 131-139.
10. M. Harada, T. A. Gulliver and H. Kaneta, Classification of extremal double circulant self-dual codes of length up to 62. Discrete Math. 188 (1998), 127-136.
11. M. Harada and H. Kimura, New extremal doubly-even [64, 32, 12] codes. Des. Codes and Cryptogr. 6 (1995), 91-96.
12. M. Harada and V. D. Tonchev, Singly-even self-dual codes and Hadamard matrices. Lecture Notes in Comput. Sci. vol. 948. Springer, 1995, pp. 279-284.
13. G. T. Kennedy and V. Pless, A coding theoretic approach to extending designs. Discrete Math. 142 (1995), 155-168.
14. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes. North-Holland, Amsterdam, 1977.
15. C. L. Mallows and N. J. A. Sloane, An upper bound for self-dual codes. Inform. Control. 22 (1973), 188-200.
16. V. D. Tonchev, Block designs of Hadamard type and self-dual codes (in Russian). Probl. Peredach Inform. 19 (1983), 25-30.
17. Engl. transl. Probl. Inform. Transm. 19 (1983), 270-275.
18. H. -P. Tsai, Existence of some extremal self-dual codes. IEEE Trans. Inform. Theory 38 (1992), 1829-1833.