DocumentCode
1253409
Title
On the minimal weight of some singly-even codes
Author
Yorgov, Vassil Y.
Author_Institution
Dept. of Math. Sci., Michigan Technol. Univ., Houghton, MI, USA
Volume
45
Issue
7
fYear
1999
fDate
11/1/1999 12:00:00 AM
Firstpage
2539
Lastpage
2541
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 [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)
Keywords
dual codes; minimal distance; minimal weight; self-dual code; shadow; singly-even codes; Binary codes; Error correction codes; Linear code; Rain;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/18.796401
Filename
796401
Link To Document