TY - GEN
T1 - New asymptotic bounds on the size of list codes on euclidean sphere
AU - Blinovsky, Vladimir
AU - Litsyn, Simon
PY - 2009
Y1 - 2009
N2 - Using lower bounds on components of the distance spectrum of a code on the Euclidean sphere obtained by linear programming, we derive new, better than known, upper bounds on the size of multiple packings.
AB - Using lower bounds on components of the distance spectrum of a code on the Euclidean sphere obtained by linear programming, we derive new, better than known, upper bounds on the size of multiple packings.
UR - http://www.scopus.com/inward/record.url?scp=70449482528&partnerID=8YFLogxK
U2 - 10.1109/ISIT.2009.5205969
DO - 10.1109/ISIT.2009.5205969
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:70449482528
SN - 9781424443130
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 1244
EP - 1247
BT - 2009 IEEE International Symposium on Information Theory, ISIT 2009
T2 - 2009 IEEE International Symposium on Information Theory, ISIT 2009
Y2 - 28 June 2009 through 3 July 2009
ER -