Published January 1998
| Published
Journal Article
Open
Shadow bounds for self-dual codes
- Creators
- Rains, Eric M.
Abstract
Conway and Sloane (1990) have previously given an upper bound on the minimum distance of a singly-even self-dual binary code, using the concept of the shadow of a self-dual code. We improve their bound, finding that the minimum distance of a self-dual binary code of length n is at most 4[n/24]+4, except when n mod 24=22, when the bound is 4[n/24]+6. We also show that a code of length a multiple of 24 meeting the bound cannot be singly-even. The same technique gives similar results for additive codes over GF(4) (relevant to quantum coding theory).
Additional Information
© 1998 IEEE. Manuscript received January 21, 1997; revised June 20, 1997. The author wishes to thank N. Sloane for many productive conversations; in particular, for introducing the author to shadow theory.Attached Files
Published - 00651000.pdf
Files
00651000.pdf
Files
(358.6 kB)
Name | Size | Download all |
---|---|---|
md5:ad075e33738868a1fb734699c23342bd
|
358.6 kB | Preview Download |
Additional details
- Eprint ID
- 81867
- Resolver ID
- CaltechAUTHORS:20170927-074638028
- Created
-
2017-09-27Created from EPrint's datestamp field
- Updated
-
2021-11-15Created from EPrint's last_modified field