By Topic

On the coveting radius of extremal self-dual 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

2 Author(s)

It is known that every self-dual binary code which is not doubly even is a "child" of a doubly even parent. It will be shown that an (n-2,(n-2)/2) child of an (n,n/2,d) doubly even parent has covering radius \geq d-1 . Every extremal doubly even (32,16,8) code has covering radius 6 and every extremal doubly even (48,24,12) code has covering radius 8 . The complete coset weight distribution of the (32,16,8) quadratic residue code is given, as well as bounds or exact values for the covering radii of all extremai doubly even codes of length less than or equal to 96 .

Published in:

IEEE Transactions on Information Theory  (Volume:29 ,  Issue: 3 )