Title :
On Delsarte´s linear programming bounds for binary codes
Author :
Navon, Michael ; Samorodnitsky, Alex
Author_Institution :
Hebrew Univ., Jerusalem, Israel
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.
Keywords :
binary codes; linear programming; binary codes; linear programming; upper bound; Application software; Binary codes; Binary sequences; Communication channels; Error correction codes; Linear code; Linear programming; Random variables; Upper bound; Vectors;
Conference_Titel :
Foundations of Computer Science, 2005. FOCS 2005. 46th Annual IEEE Symposium on
Print_ISBN :
0-7695-2468-0
DOI :
10.1109/SFCS.2005.55
