By Topic

On the distance distribution of duals of BCH codes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
2 Author(s)
Krasikov, I. ; Sch. of Math. Sci., Tel Aviv Univ., Israel ; Litsyn, S.

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

Published in:

Information Theory, IEEE Transactions on  (Volume:45 ,  Issue: 1 )