On the minimal weight of some singly-even codes
Document Type
Article
Publication Date
12-1-1999
Abstract
It is shown that the minimal distance d of a singly-even self-dual [24t+8, 12t+4] code is at most 4t+2 if its shadow contains a weight 4 vector, t is even, and (t5t) is odd. It is proved particularly that there does not exist a singly-even self-dual code with 4862 words of weight 12. This answers a question of Conway and Sloane raised in their joint paper in 1990.
Publication Title
IEEE Transactions on Information Theory
Recommended Citation
Yorgov, V.
(1999).
On the minimal weight of some singly-even codes.
IEEE Transactions on Information Theory,
45(7), 2539-2541.
http://doi.org/10.1109/18.796401
Retrieved from: https://digitalcommons.mtu.edu/michigantech-p/10208
