Linear programming bounds for codes via a covering argument

Details Linear programming bounds for codes via a covering argument Linear programming bounds for codes via a covering argument

2007-02-14

arxiv.org/abs/math/0702425v1

Mathematics

Combinatorics

Scientific paper

We recover the first linear programming bound of McEliece, Rodemich, Rumsey, and Welch for binary error-correcting codes and designs via a covering argument. It is possible to show, interpreting the following notions appropriately, that if a code has a large distance, then its dual has a small covering radius and, therefore, is large. This implies the original code to be small. We also point out (in conjunction with further work) that this bound is a natural isoperimetric constant of the Hamming cube, related to its Faber-Krahn minima. While our approach belongs to the general framework of Delsarte's linear programming method, its main technical ingredient is Fourier duality for the Hamming cube. In particular, we do not deal directly with Delsarte's linear program or orthogonal polynomial theory.

Affiliated with

Also associated with

No associations

Rating

Linear programming bounds for codes via a covering argument does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Linear programming bounds for codes via a covering argument, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Linear programming bounds for codes via a covering argument will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-209992