A limit law on the distance distribution of binary codes
- 1 January 1990
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 36 (1) , 229-232
- https://doi.org/10.1109/18.50398
Abstract
An approximation is given of the distance distribution of a binary code by the binomial distribution with an exponentially decreasing error term. Specifically, the upper bound of the relative error term between the normalized distance distribution of a binary code and the binomial distribution has been asymptotically improved. In particular, the bound becomes exponentially small for large distances in families of codes with small σ and rate >0.5. The approach used was based on an integral representation of Krawtchouk polynomials. Examples of interest are BCH codes of primitive length, duals of irreducible cyclic codes, and Preparata codesKeywords
This publication has 2 references indexed in Scilit:
- An approximation to the weight distribution of binary linear codesIEEE Transactions on Information Theory, 1985
- Crosscorrelation properties of pseudorandom and related sequencesProceedings of the IEEE, 1980