DocumentCode
2990613
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
fYear
2009
fDate
June 28 2009-July 3 2009
Firstpage
1244
Lastpage
1247
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;
fLanguage
English
Publisher
ieee
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
Type
conf
DOI
10.1109/ISIT.2009.5205969
Filename
5205969
Link To Document