On the distance distribution of duals of BCH codes

  • Authors:

  • I. Krasikov;S. Litsyn

  • Affiliations:

  • Sch. of Math. Sci., Tel Aviv Univ.;-

  • Venue:
  • IEEE Transactions on Information Theory
  • Year:
  • 2006

Quantified Score

Hi-index 754.84

Visualization

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