TY - GEN
T1 - On Delsarte's linear programming bounds for binary codes
AU - Navon, Michael
AU - Samorodnitsky, Alex
PY - 2005
Y1 - 2005
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=33748590512&partnerID=8YFLogxK
U2 - 10.1109/sfcs.2005.55
DO - 10.1109/sfcs.2005.55
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:33748590512
SN - 0769524680
SN - 9780769524689
T3 - Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
SP - 327
EP - 336
BT - Proceedings - 46th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2005
T2 - 46th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2005
Y2 - 23 October 2005 through 25 October 2005
ER -