Hadamard matrices and doubly even self-dual error-correcting codes
Journal of Combinatorial Theory Series A
A method for constructing inequivalent self-dual codes with applications to length 56
IEEE Transactions on Information Theory
Combinatorial configurations, designs, codes, graphs
Combinatorial configurations, designs, codes, graphs
Self-orthogonal designs and extremal doubly even codes
Journal of Combinatorial Theory Series A
External doubly-even codes of length 40 derived from Hadamard matrices of order 20
Discrete Mathematics
Classification of Hadamard matrices of order 28
Discrete Mathematics
New extremal doubly-even [64, 32, 12] codes
Designs, Codes and Cryptography
Graphs, Codes and Designs
Weight Enumerators of Double Circulant Codes and New ExtremalSelf-Dual Codes
Designs, Codes and Cryptography
On the Binary Self-Dual Codes with an Automorphism of Order2
Designs, Codes and Cryptography
Construction of new extremal self-dual codes
Discrete Mathematics
New Extremal Type I Codes of Lengths 40, 42, and 44
Designs, Codes and Cryptography
Self-Orthogonal 3-(56,12,65) Designs and Extremal Doubly-Even Self-Dual Codes of Length 56
Designs, Codes and Cryptography
On the classification and enumeration of self-dual codes
Finite Fields and Their Applications
| Hi-index | 0.00 |
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.