Title :
New asymptotic bounds on the size of list codes on Euclidean sphere
Author :
Blinovsky, Vladimir ; Litsyn, Simon
Author_Institution :
Inst. of Inf. Transm. Problems, Moscow, Russia
fDate :
June 28 2009-July 3 2009
Abstract :
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.
Keywords :
codes; linear programming; Euclidean sphere; asymptotic bounds; distance spectrum; linear programming; list codes; Decoding; Equations; Linear programming; Upper bound;
Conference_Titel :
Information Theory, 2009. ISIT 2009. IEEE International Symposium on
Conference_Location :
Seoul
Print_ISBN :
978-1-4244-4312-3
Electronic_ISBN :
978-1-4244-4313-0
DOI :
10.1109/ISIT.2009.5205969
