On the distance distribution of duals of BCH codes

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

Full metadata record

DC Field	Value	Language
dc.contributor.author	Krasikov, I	-
dc.contributor.editor	Litsyn, S	-
dc.coverage.spatial	4	en
dc.date.accessioned	2009-05-22T09:56:47Z	-
dc.date.available	2009-05-22T09:56:47Z	-
dc.date.issued	1999	-
dc.identifier.citation	Information Theory, IEEE Transactions on. 45 (1) 247-250	en
dc.identifier.other	DOI:: 10.1109/18.746798	-
dc.identifier.uri	http://bura.brunel.ac.uk/handle/2438/3325	-
dc.description.abstract	We derive upper bounds on the components of the distance distribution of duals of BCH codes. Roughly speaking, these bounds show that the distance distribution can be upper-bounded by the corresponding normal distribution. To derive the bounds we use the linear programming approach along with some estimates on the magnitude of Krawtchouk polynomials of fixed degree in a vicinity of q/2	en
dc.format.extent	167559 bytes	-
dc.format.mimetype	application/pdf	-
dc.language.iso	en	-
dc.publisher	IEEE	en
dc.subject	BCH codes; distance distribution	en
dc.title	On the distance distribution of duals of BCH 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
On the distance distribution of duals of BCH codes.pdf		163.63 kB	Adobe PDF	View/Open