Flat tori, lattices and bounds for commutative group codes
From MaRDI portal
Publication:1009072
DOI10.1007/s10623-008-9183-9zbMath1178.94253OpenAlexW1991932593MaRDI QIDQ1009072
Sueli I. R. Costa, Rogério M. Siqueira
Publication date: 31 March 2009
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-008-9183-9
Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Bounds on codes (94B65) Other types of codes (94B60) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)
Related Items (4)
Commutative group codes in \(\mathbb R^4\), \(\mathbb R^6\), \(\mathbb R^8\) and \(\mathbb R^{16}\)-approaching the bound ⋮ A note on suborthogonal lattices ⋮ Optimum commutative group codes ⋮ A heuristic approach for designing cyclic group codes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Lattices with few distances
- New upper bounds on sphere packings. I
- Optimum commutative group codes
- Über die dichteste Kugellagerung
- Über eine Abschätzung des kürzesten Abstandes zweier Punkte eines auf einer Kugelfläche liegenden Punktsystems
- The Packing of Equal Spheres
- Geometrically uniform codes
- Graphs, Tessellations, and Perfect Codes on Flat Tori
- Curves on a sphere, shift-map dynamics, and error control for continuous alphabet sources
- Packing of spheres in spaces of constant curvature
- Signal sets matched to groups
- Cyclic-group codes for the Gaussian channel (Corresp.)
- Linear block codes over cyclic groups
- Upper bounds on the minimum distance of spherical codes
- Group Codes for the Gaussian Channel
- On the existence of group codes for the Gaussian channel
- Commutative group codes for the Gaussian channel
- Arrangements of equal spheres in non-Euclidean spaces
- The Closest Packing of Spherical Caps in n Dimensions
This page was built for publication: Flat tori, lattices and bounds for commutative group codes
