Linear programming bounds for doubly-even self-dual codes

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

Full metadata record

DC Field	Value	Language
dc.contributor.author	Krasikov, I	-
dc.contributor.editor	Litsyn, S	-
dc.coverage.spatial	7	en
dc.date.accessioned	2009-05-22T09:56:09Z	-
dc.date.available	2009-05-22T09:56:09Z	-
dc.date.issued	1997	-
dc.identifier.citation	Information Theory, IEEE Transactions on. 43 (4) 1238-1244	en
dc.identifier.other	DOI: 10.1109/18.605587	-
dc.identifier.uri	http://bura.brunel.ac.uk/handle/2438/3324	-
dc.description.abstract	Using a variant of linear programming method 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 d/n <=166315 + o(1), thus improving on the Mallows– Odlyzko–Sloane bound of 1/6. To establish this, we prove that in any doubly even-self-dual code the distance distribution is asymptotically upper-bounded by the corresponding normalized binomial distribution in a certain interval.	en
dc.format.extent	452440 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	Linear programming bounds for 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
Linear programming bounds for doubly-even.pdf		441.84 kB	Adobe PDF	View/Open