Polynomial-time construction of codes .II. spherical codes and the kissing number of spheres

DOI10.1109/18.335961zbMath0813.94024OpenAlexW2097941916MaRDI QIDQ4324175

Jacques Stern, Gilles Lachaud

Publication date: 1 March 1995

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

Full work available at URL: https://doi.org/10.1109/18.335961

zbMATH Keywords

kissing numberpolynomial-time algorithmsspherical codesasymptotic boundsconcatenation

Mathematics Subject Classification ID

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

Related Items (3)

Arithmetic, Geometry, and Coding Theory: Homage to Gilles Lachaud ⋮ Constructive spherical codes near the Shannon bound ⋮ Polynomial-time construction of codes. I: Linear codes with almost equal weights

This page was built for publication: Polynomial-time construction of codes .II. spherical codes and the kissing number of spheres