Asymptotically dense spherical codes - Part h Wrapped spherical codes

@article{Hamkins1997AsymptoticallyDS,
  title={Asymptotically dense spherical codes - Part h Wrapped spherical codes},
  author={Jon Hamkins and Kenneth Zeger},
  journal={IEEE Trans. Inf. Theory},
  year={1997},
  volume={43},
  pages={1774-1785}
}
  • J. Hamkins, K. Zeger
  • Published 1 November 1997
  • Mathematics, Computer Science
  • IEEE Trans. Inf. Theory
A new class of spherical codes called wrapped spherical codes is constructed by "wrapping" any sphere packing /spl Lambda/ in Euclidean space onto a finite subset of the unit sphere in one higher dimension. The mapping preserves much of the structure of /spl Lambda/, and unlike previously proposed maps, the density of the wrapped spherical codes approaches the density of /spl Lambda/ as the minimum distance approaches zero. We show that this implies that the asymptotically maximum spherical… Expand
Asymptotically dense spherical codes - Part II: Laminated spherical codes
TLDR
The three-dimensional laminated spherical code is asymptotically optimal, in the sense that its density approaches the Fejes Toth (1959) upper bound as the minimum distance approaches zero. Expand
Spherical codes on torus layers
TLDR
The torus layer spherical codes presented here exhibit good performance when compared to the well known apple-peeling, wrapped and laminated codes. Expand
Constructive Spherical Codes on Layers of Flat Tori
TLDR
A new class of spherical codes is constructed by selecting a finite subset of flat tori from a foliation of the unit sphere R2L and designing a structured codebook on each torus layer, which can be the image of a lattice restricted to a specific box in RL in each layer. Expand
Structured spherical codes with asymptotically optimal distance distributions
TLDR
It is shown that the distance spectrum of cyclic group codes achieves optimality in the sense of matching the random spherical code distance distribution bound as the block length grows large. Expand
Flat tori, lattices and spherical codes
The foliation of a sphere in an even number of dimensions by flat tori can be used to construct discrete spherical codes and also homogeneous curves for transmitting a continuous alphabet source overExpand
Asymptotic bounds for spherical codes
TLDR
The main purpose of this article consists in extending the classical strategy of inventing explicit constructions of "good codes" and comparing new classes of codes with earlier ones to domain of spherical codes. Expand
Gaussian source coding with spherical codes
TLDR
A wrapped Leech lattice shape quantizer is used to demonstrate a signal-to-quantization-noise ratio within 1 dB of the distortion-rate function for rates above 1 bit per sample, and an improvement over existing techniques of similar complexity. Expand
Constructive spherical codes in 2k dimensions
TLDR
This work presents a new approach to construct spherical codes in 2k dimensions, based on Hopf foliations, which outperforms some current constructive methods in several smalldistance regimes and constitutes a compromise between optimality and computational effort. Expand
A heuristic approach for designing cyclic group codes
TLDR
The obtained results assure that the heuristic approach have performance comparable to a brute-force search technique with the advantage of having low complexity, allowing for designing codes with a large number of points in higher dimensions. Expand
Space frequency codes from spherical codes
  • O. Henkel
  • Mathematics, Computer Science
  • Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.
  • 2005
A new design method for high rate, fully diverse ('spherical') space frequency codes for MIMO-OFDM systems is proposed, which works for arbitrary numbers of antennas and subcarriers. The constructionExpand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 56 REFERENCES
Asymptotically optimal spherical codes
  • J. Hamkins, K. Zeger
  • Mathematics
  • Proceedings of 1995 IEEE International Symposium on Information Theory
  • 1995
A new class of spherical codes is presented which are designed analogously to laminated lattice construction. For many minimum angular separations, these "laminated spherical codes" outperform theExpand
Asymptotically dense spherical codes - Part II: Laminated spherical codes
TLDR
The three-dimensional laminated spherical code is asymptotically optimal, in the sense that its density approaches the Fejes Toth (1959) upper bound as the minimum distance approaches zero. Expand
Nearest neighbor algorithm for spherical codes from the Leech lattice
TLDR
A nearest-neighbor algorithm that works on this is developed to determine the point in the code closet to some arbitrary vector in R/sup 24/. Expand
SPHERICAL CODES AND DESIGNS
Publisher Summary This chapter provides an overview of spherical codes and designs. A finite non-empty set X of unit vectors in Euclidean space R d has several characteristics, such as the dimensionExpand
Spherical codes and designs
Publisher Summary This chapter provides an overview of spherical codes and designs. A finite non-empty set X of unit vectors in Euclidean space R d has several characteristics, such as the dimensionExpand
Spherical codes generated by binary partitions of symmetric pointsets
TLDR
Several constructions are presented by which spherical codes are generated from groups of binary codes, the main ideas are code concatenation and set partitioning. Expand
Tables of sphere packings and spherical codes
  • N. Sloane
  • Mathematics, Computer Science
  • IEEE Trans. Inf. Theory
  • 1981
TLDR
The theta functions of a number of important packings and tables of the first fifty or so of their coefficients are given in this paper. Expand
Constructing Spherical Codes by Global Optimization Methods
In this work we search for spherical codes in three to ve dimensions using diierent global optimization methods. In three dimensions the problem of nding optimal spherical codes is the TammesExpand
Iteratively maximum likelihood decodable spherical codes and a method for their construction
TLDR
A class of spherical codes which can be easily decoded by an efficient iterative maximum likelihood decoding algorithm is proposed and a systematic construction method based on shrinking of Voronoi corners is analyzed. Expand
Polynomial-time construction of codes II. Spherical codes and the kissing number of spheres
TLDR
The polynomially constructible spherical bound R/sub pol/(/spl rho/) is defined with the additional restriction that only families of codes with polynomial complexity of construction are considered. Expand
...
1
2
3
4
5
...