Abstract
Recently the author and Kimura have considered a construction of doubly-even codes from a given doubly-even code. In this note, we show that the restricutoion of doubly-even can be removed in the above construction. As an application, at least 137 inequivalent extremal doubly-even [56,28,12] codes and at least 1000 inequivalent extremal doubly-even [40,20,8] codes are constructed from known self-dual codes. The existence of new extremal singly-even codes is also described.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
V. K. Bhargava and J. M. Stein, (v; k; λ) configurations and self-dual codes, Inform. Control, Vol. 28 (1975) pp. 352–355.
R. A. Brualdi and V. S. Pless, Weight enumerators of self-dual codes, IEEE Trans. Inform. Theory, Vol. 37 (1991) pp. 1222–1225.
F. C. Bussemarker and V. D. Touchev, New extremal doubly-even codes of length 56 derived from Hadamard matrices of order 28, Discrete Math., Vol. 76 (1989) pp. 45–49.
F. C. Bussemarker and V. D. Tonchev, Extremal doubly-even codes of length 40 derived from Hadamard matrices of order 20, Discrete Math., Vol. 82 (1990) pp. 317–321.
P. J. Cameron and J. H. van Lint, Graphs, Codes and Designs, Cambridge University Press, Cambridge, (1980).
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.
M. Harada and H. Kimura, Newextremal doubly-even [64, 32, 12] codes, Designs, Codes and Cryptography, Vol. 6 (1995), pp. 91–96.
W. C. Huffman, Automorphisms of codes with applications to extremal doubly even codes of length 48, IEEE Trans. Inform. Theory, Vol. 28 (1982) pp. 511–521.
H. Kimura, Extremal doubly even (56, 28, 12) codes and Hadamard matrices of order 28, Australas. J. Combin., Vol. 10 (1994) pp. 171–180.
F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes, North-Holland, Amsterdam, (1977).
C. L. Mallows and N. J. A. Sloane, An upper bound for self-dual codes, Inform. Control, Vol. 22 (1973) pp. 188–200.
M. Ozeki, Hadamard matrices and doubly even self-dual error-correcting codes, J. Combin. Theory Ser. A, Vol. 44 (1987) pp. 274–287.
V. D. Tonchev, Combinatorial Configurations, Longman Scientific and Technical, Wiley, New York, (1988).
V. D. Tonchev, Self-orthogonal designs and extremal doubly-even codes, J. Combin. Theory Ser. A, Vol. 52 (1989) pp. 197–205.
H.-P. Tsai, Existence of some extremal self-dual codes, IEEE Trans. Inform. Theory, Vol. 38 (1992) pp. 1829–1833.
V. Yorgov, Doubly-even extremal codes of length 64, Problem Peredachi Informatsii, Vol. 22, No. 4 (1986) pp. 35–42, (in Russian). English translation in: Problems Inform. Transmission (April, 1987) pp. 277–284.
V. Yorgov, A method for constructing inequivalent self-dual codes with applications to length 56, IEEE Trans. Inform. Theory, Vol. 33 (1987) pp. 72–82.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Harada, M. Existence of New Extremal Doubly-Even Codes and Extremal Singly-Even Codes. Designs, Codes and Cryptography 8, 273–283 (1996). https://doi.org/10.1023/A:1027303722125
Issue Date:
DOI: https://doi.org/10.1023/A:1027303722125