An improved upper bound on the minimum distance of doubly-even self-dual codes

Please use this identifier to cite or link to this item: http://bura.brunel.ac.uk/handle/2438/3326

Full metadata record

DC Field	Value	Language
dc.contributor.author	Krasikov, I	-
dc.contributor.author	Litsyn, S	-
dc.coverage.spatial	5	en
dc.date.accessioned	2009-05-22T09:57:15Z	-
dc.date.available	2009-05-22T09:57:15Z	-
dc.date.issued	2000	-
dc.identifier.citation	IEEE Transactions on Information Theory, 46 (1) 274-278	en
dc.identifier.other	DOI: 10.1109/18.817527	-
dc.identifier.uri	http://bura.brunel.ac.uk/handle/2438/3326	-
dc.description.abstract	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-5^3/4)/10 <0.165630, thus improving on the Mallows-Odlyzko-Sloane bound of 1/6 and our recent bound of 0.166315	en
dc.format.extent	172034 bytes	-
dc.format.mimetype	application/pdf	-
dc.language.iso	en	-
dc.publisher	IEEE	en
dc.subject	distance distribution; self-dual codes; upper bounds	en
dc.title	An improved upper bound on the minimum distance of doubly-even self-dual codes	en
dc.type	Research Paper	en
Appears in Collections:	Dept of Mathematics Research Papers Mathematical Sciences

Files in This Item:

File	Description	Size	Format
An improved upper bound on the minimum distance of doubly-even.pdf		168 kB	Adobe PDF	View/Open