Constructive spherical codes near the Shannon bound

DOI10.1007/S10623-012-9633-2zbMATH Open1268.94041arXiv1101.1895OpenAlexW2092247859MaRDI QIDQ1934239FDOQ1934239

Authors: Patrick Solé, Jean-Claude Belfiore 

Publication date: 28 January 2013

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Abstract: Shannon gave a lower bound in 1959 on the binary rate of spherical codes of given minimum Euclidean distance $ho$. Using nonconstructive codes over a finite alphabet, we give a lower bound that is weaker but very close for small values of $ho$. The construction is based on the Yaglom map combined with some finite sphere packings obtained from nonconstructive codes for the Euclidean metric. Concatenating geometric codes meeting the TVZ bound with a Lee metric BCH code over $GF(p),$ we obtain spherical codes that are polynomial time constructible. Their parameters outperform those obtained by Lachaud and Stern in 1994. At very high rate they are above 98 per cent of the Shannon bound.

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

Recommendations

• Asymptotically dense spherical codes. I. Wrapped spherical codes
• A new upper bound on the reliability function of the Gaussian channel
• Asymptotic bounds for spherical codes
• scientific article; zbMATH DE number 1189034
• Polynomial-time construction of codes .II. spherical codes and the kissing number of spheres
• Improved sphere bounds on the covering radius of codes
• New asymptotic bounds on the size of multiple packings of the Euclidean sphere
• Constructive kissing numbers in high-dimensional spaces
• Sphere-Packing Bounds for Convolutional Codes
• Finding and investigating exact spherical codes

zbMATH Keywords

saddle point methodspherical codescodes for the Euclidean metric

Mathematics Subject Classification ID

Bounds on codes (94B65) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)

Cites Work

• Algebraic coding theory
• Fundamentals of Error-Correcting Codes
• Improved Methods for Calculating Vectors of Short Length in a Lattice, Including a Complexity Analysis
• Title not available (Why is that?)
• Codes on Euclidean spheres
• A lower bound on packing density
• Lee-metric BCH codes and their application to constrained and partial-response channels
• An improvement to the Minkowski‐Hiawka bound for packing superballs
• Constructive high-dimensional sphere packings
• Polynomial-time construction of codes .II. spherical codes and the kissing number of spheres
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (11)

• Decoding spherical codes for the Gaussian channel
• Upper bounds on the minimum distance of spherical codes
• Iteratively maximum likelihood decodable spherical codes and a method for their construction
• Perfect codes in the \(\ell_p\) metric
• Polynomial-time construction of codes .II. spherical codes and the kissing number of spheres
• Title not available (Why is that?)
• Distance Verification for Classical and Quantum LDPC Codes
• Sphere-Packing Bounds Revisited for Moderate Block Lengths
• The concatenation method for construction of spherical codes in \(n\)-dimensional Euclidean space
• Bounds for codes over the unit circle
• Asymptotic bounds for spherical codes

This page was built for publication: Constructive spherical codes near the Shannon bound

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