By Topic

On the minimal weight of some singly-even codes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
V. Y. Yorgov ; Dept. of Math. Sci., Michigan Technol. Univ., Houghton, MI, USA

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 [56, 28, 12] singly even self-dual code with 4862 words of weight 12. This answers a question raised by Conway and Sloane (see ibid., vol.36, p.1319-33, 1990)

Published in:

IEEE Transactions on Information Theory  (Volume:45 ,  Issue: 7 )