loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05)
On Delsarte?s Linear Programming Bounds for Binary Codes
Pittsburgh, Pennsylvania, USA
October 23-October 25
ISBN: 0-7695-2468-0
ASCII Text
x 
 
Michael Navon, Alex Samorodnitsky, "On Delsarte?s Linear Programming Bounds for Binary Codes," Foundations of Computer Science, IEEE Annual Symposium on, pp. 327-338, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05), 2005.
 
 
BibTex
x
 
@article{ 10.1109/SFCS.2005.55,
author = {Michael Navon and Alex Samorodnitsky},
title = {On Delsarte?s Linear Programming Bounds for Binary Codes},
journal ={Foundations of Computer Science, IEEE Annual Symposium on},
volume = {0},
year = {2005},
isbn = {0-7695-2468-0},
pages = {327-338},
doi = {http://doi.ieeecomputersociety.org/10.1109/SFCS.2005.55},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Foundations of Computer Science, IEEE Annual Symposium on
TI - On Delsarte?s Linear Programming Bounds for Binary Codes
SN - 0-7695-2468-0
SP327
EP338
A1 - Michael Navon,
A1 - Alex Samorodnitsky,
PY - 2005
KW - null
VL - 0
JA - Foundations of Computer Science, IEEE Annual Symposium on
ER -
 
Michael Navon, The Hebrew University of Jerusalem
Alex Samorodnitsky, The Hebrew University of Jerusalem

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.

Citation:
Michael Navon, Alex Samorodnitsky, "On Delsarte?s Linear Programming Bounds for Binary Codes," focs, pp.327-338, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.