Small codes

DOI10.1112/BLMS.13019MaRDI QIDQ6499406zbMATH OpenWikidataFDO

Authors Igor Balla

Publication date 8 May 2024

Published in Bulletin of the London Mathematical Society (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1112/BLMS.13019

Mathematics Subject Classification ID

Ramsey theory (05D10) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Bounds on codes (94B65)

Recommendations

• Bounds on equiangular lines and on related spherical codes
• Sets of vectors with many orthogonal pairs
• Bounds for codes over the unit circle
• On the size of maximal binary codes with 2, 3, and 4 distances
• Avoiding right angles and certain Hamming distances

Cites work

• Bounds for binary codes just outside the plotkin range
• scientific article; zbMATH DE number 4093363 (Why is no real title available?)
• scientific article; zbMATH DE number 3704481 (Why is no real title available?)
• scientific article; zbMATH DE number 107643 (Why is no real title available?)
• scientific article; zbMATH DE number 3633251 (Why is no real title available?)
• scientific article; zbMATH DE number 3382186 (Why is no real title available?)
• Nearly orthogonal vectors and small antipodal spherical codes
• Perturbed Identity Matrices Have High Rank: Proof and Applications
• Sphere packing bounds via spherical codes
• The Closest Packing of Spherical Caps in n Dimensions
• The Tammes problem for N = 14

This page was built for publication: Small codes

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