Constructive Spherical Codes on Layers of Flat Tori

DOI10.1109/TIT.2013.2272931MaRDI QIDQ5346313zbMATH OpenOpenAlexFDO

Authors Cristiano Torezzan, Sueli I. R. Costa, Vinay Vaishampayan

Publication date 8 June 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1205.5914

Mathematics Subject Classification ID

Communication theory (94A05) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)

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 R^L 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.

Cited in

(4)

• Analogs of Steiner's porism and Soddy's hexlet in higher dimensions via spherical codes
• A shape-gain approach for vector quantization based on flat tori
• Optimum commutative group codes
• A heuristic approach for designing cyclic group codes

This page was built for publication: Constructive Spherical Codes on Layers of Flat Tori

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5346313)