Abstract
We derive new estimates for the range of binomiality in a code's spectra, where the distance distribution of a code is upperbounded by the corresponding normalized binomial distribution. The estimates depend on the code's dual distance.
Original language | English |
---|---|
Pages (from-to) | 987-991 |
Number of pages | 5 |
Journal | IEEE Transactions on Information Theory |
Volume | 43 |
Issue number | 3 |
DOIs | |
State | Published - 1997 |
Keywords
- Krawtchouk polynomials
- Spectra of codes