Design of Differential Space-Time Codes Using Group Theory
AAECC-14 Proceedings of the 14th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Design and analysis of a successively refinable lattice quantizer for i.i.d. Gaussian sources
IEEE Transactions on Signal Processing
Spherical codes on torus layers
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
Spherical logarithmic quantization
IEEE Transactions on Audio, Speech, and Language Processing
IWDW'05 Proceedings of the 4th international conference on Digital Watermarking
Fixed-Distortion orthogonal dirty paper coding for perceptual still image watermarking
IH'04 Proceedings of the 6th international conference on Information Hiding
| Hi-index | 754.84 |
A new class of spherical codes called wrapped spherical codes is constructed by “wrapping” any sphere packing Λ in Euclidean space onto a finite subset of the unit sphere in one higher dimension. The mapping preserves much of the structure of Λ, and unlike previously proposed maps, the density of the wrapped spherical codes approaches the density of Λ as the minimum distance approaches zero. We show that this implies that the asymptotically maximum spherical coding density is achieved by wrapped spherical codes whenever Λ is the densest possible sphere packing