Constructive spherical codes near the Shannon bound
From MaRDI portal
Publication:1934239
DOI10.1007/s10623-012-9633-2zbMath1268.94041arXiv1101.1895MaRDI QIDQ1934239
Jean-Claude Belfiore, Patrick Solé
Publication date: 28 January 2013
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1101.1895
94B65: Bounds on codes
94B27: Geometric methods (including applications of algebraic geometry) applied to coding theory
94B75: Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Constructive high-dimensional sphere packings
- A lower bound on packing density
- Improved Methods for Calculating Vectors of Short Length in a Lattice, Including a Complexity Analysis
- An improvement to the Minkowski‐Hiawka bound for packing superballs
- Lee-metric BCH codes and their application to constrained and partial-response channels
- Polynomial-time construction of codes .II. spherical codes and the kissing number of spheres
- Fundamentals of Error-Correcting Codes