By Topic

Weight enumerators of 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)
R. A. Brualdi ; Dept. of Math., Wisconsin Univ., Madison, WI, USA ; V. S. Pless

Some construction techniques for self-dual codes are investigated, and the authors construct a singly-even self-dual [48,24,10]-code with a weight enumerator that was not known to be attainable. It is shown that there exists a singly-even self-dual code C' of length n =48 and minimum weight d=10 whose weight enumerator is prescribed in the work of J.H. Conway et al. (see ibid., vol.36, no.5, p.1319-33, 1990). Two self-dual codes of length n are called neighbors, provided their intersection is a code of dimension (n/2)-1. The code C' is a neighbor of the extended quadratic residue code of length 48

Published in:

IEEE Transactions on Information Theory  (Volume:37 ,  Issue: 4 )