Referenced Items are not available for this document.
We derive a new upper bound on the minimum distance d of doubly-even self-dual codes of length n. Asymptotically, for n growing, it gives limn→∞ sup d/n⩽(5-53/4)/10<0.165630, thus improving on the Mallows-Odlyzko-Sloane bound of 1/6 and our recent bound of 0.166315
Published in:
Information Theory, IEEE Transactions on
(Volume:46
,
Issue:
1
)
Date of Publication: Jan 2000
- Page(s):
- 274 - 278
- ISSN :
- 0018-9448
- INSPEC Accession Number:
- 6486010
- Digital Object Identifier :
- 10.1109/18.817527
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 06 August 2002
- Issue Date :
- Jan 2000
- Sponsored by :
- IEEE Information Theory Society
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
