On Delsarte's Linear Programming Bounds for Binary Codes

Authors:
Michael Navon;Alex Samorodnitsky
Affiliations:
The Hebrew University of Jerusalem;The Hebrew University of Jerusalem
Venue:
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Year:
2005

Citing 6
Cited 1

A fast and simple randomized parallel algorithm for the maximal independent set problem

Journal of Algorithms
Zeros of generalized Krawtchouk polynomials

Journal of Approximation Theory
On the optimum of Delsarte's linear program

Journal of Combinatorial Theory Series A
Linear Codes and Character Sums

Combinatorica
New upper bounds on error exponents

IEEE Transactions on Information Theory
On the distance distribution of codes

IEEE Transactions on Information Theory

Kleptographic attacks on a cascade of mix servers

ASIACCS '07 Proceedings of the 2nd ACM symposium on Information, computer and communications security

Quantified Score

Hi-index	0.00

Visualization

Abstract

We prove two results about the value of Delsarte驴s linear program for binary codes.Our main result is a new lower bound on the value of the program, which, in particular, is nearly tight for low rate codes. We also give an easy proof of a (known) upper bound, which coincides with the best known bound for a wide range of parameters.