Papers
Topics
Authors
Recent
Search
2000 character limit reached

Constructive spherical codes on layers of flat tori

Published 26 May 2012 in cs.IT and math.IT | (1205.5914v1)

Abstract: A new class of spherical codes is constructed by selecting a finite subset of flat tori from a foliation of the unit sphere S{2L-1} of R{2L} and designing a structured codebook on each torus layer. The resulting spherical code can be the image of a lattice restricted to a specific hyperbox in RL in each layer. Group structure and homogeneity, useful for efficient storage and decoding, are inherited from the underlying lattice codebook. A systematic method for constructing such codes are presented and, as an example, the Leech lattice is used to construct a spherical code in R{48}. Upper and lower bounds on the performance, the asymptotic packing density and a method for decoding are derived.

Citations (12)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.