Asymptotically dense spherical codes .2. Laminated spherical codes

被引:18
作者
Hamkins, J [1 ]
Zeger, K [1 ]
机构
[1] UNIV CALIF SAN DIEGO,DEPT ELECT & COMP ENGN,LA JOLLA,CA 92093
基金
美国国家科学基金会;
关键词
asymptotic density; laminated lattices; packing; source and channel coding; spherical codes;
D O I
10.1109/18.641545
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
New spherical codes called laminated spherical codes are constructed in dimensions 2-49 using a technique similar to the construction of laminated lattices. Each spherical code is recursively constructed from existing spherical codes in one lower dimension. Laminated spherical codes outperform the best known spherical codes in the minimum distance sense for many code sizes. The density of a laminated spherical code approaches the density of the laminated lattice in one lower dimension, as the minimum distance approaches zero. In particular, the three-dimensional laminated spherical code is asymptotically optimal, in the sense that its density approaches the Fejes Toth upper bound as the minimum distance approaches zero. Laminated spherical codes perform asymptotically as well as wrapped spherical codes in those dimensions where laminated lattices are optimal sphere packings.
引用
收藏
页码:1786 / 1798
页数:13
相关论文
共 7 条
[1]  
Conway J. H., 1993, SPHERE PACKINGS LATT
[2]   USING SIMULATED ANNEALING TO DESIGN GOOD CODES. [J].
El Gamal, Abbas A. ;
Hemachandra, Lane A. ;
Shperling, Itzhak ;
Wei, Victor K. .
IEEE Transactions on Information Theory, 1987, IT-33 (01) :116-123
[3]  
HAMKINS J, 1996, THESIS U ILLINOIS UR
[4]   SPHERE PACKING IN R3 [J].
LINDSEY, JH .
MATHEMATIKA, 1986, 33 (65) :137-147
[5]   TABLES OF SPHERE PACKINGS AND SPHERICAL CODES [J].
SLOANE, NJA .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1981, 27 (03) :327-338
[6]  
Toth L. Fejes, 1959, ARCH MATH, V10, P307
[7]  
YAGLOM IM, 1958, SOME RESULTS DISTRIB