Polynomial-time construction of spherical codes

DOI10.1007/3-540-54522-0_110MaRDI QIDQ4038757zbMATH OpenFDO

Authors Gilles Lachaud, Jacques Stern

Publication date 18 May 1993

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-54522-0_110

zbMATH Keywords

Katsman-Tsfasman-Vlăduţ bound for linear codeslower boundspherical codes

Mathematics Subject Classification ID

Cyclic codes (94B15)

Recommendations

• Polynomial-time construction of codes .II. spherical codes and the kissing number of spheres
• Constructive kissing numbers in high-dimensional spaces
• Constructive spherical codes near the Shannon bound
• Upper bounds on the minimum distance of spherical codes
• scientific article; zbMATH DE number 844679

Cited in

(5)

• The concatenation method for construction of spherical codes in \(n\)-dimensional Euclidean space
• Polynomial-time construction of codes. I: Linear codes with almost equal weights
• Polynomial-time construction of codes .II. spherical codes and the kissing number of spheres
• scientific article; zbMATH DE number 1995821 (Why is no real title available?)
• Distance Verification for Classical and Quantum LDPC Codes

This page was built for publication: Polynomial-time construction of spherical codes

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