By Topic

On two doubly even self-dual binary codes of length 160 and minimum weight 24

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

4 Author(s)
M. van Dijk ; Lab. for Comput. Sci., Massachusetts Inst. of Technol., Cambridge, MA, USA ; S. Egner ; M. Greferath ; A. Wassermann

This correspondence revisits the idea of constructing a binary [mn,mk] code from an [n,k] code over F2m by concatenating the code with a suitable basis representation of F2m over F2. We construct two nonequivalent examples of doubly even self-dual binary codes of length 160 which turn out to be of minimum distance 24. This improves the lower bound for this class of codes, whereas the upper bound is given by 28. The construction at hand seems to be of interest beyond this particular example.

Published in:

IEEE Transactions on Information Theory  (Volume:51 ,  Issue: 1 )