Upper bounds on the minimum distance of spherical codes

DOI10.1109/18.532903zbMath0857.94023OpenAlexW2114067035MaRDI QIDQ4896843

Silvya P. Bumova, Danyo Danev, P. G. Boyvalenkov

Publication date: 22 October 1996

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

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

zbMATH Keywords

linear programmingupper boundsGegenbauer polynomialsminimum distancespherical codes

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Bounds on codes (94B65) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15) Other types of codes (94B60)

Related Items (9)

On the convergence analysis of a penalty algorithm for nonsmooth optimization and its performance for solving hard-sphere problems ⋮ Unnamed Item ⋮ Estimates of the maximal value of angular code distance for 24 and 25 points on the unit sphere in \(\mathbb{R}^4\) ⋮ Universal lower bounds for potential energy of spherical codes ⋮ Flat tori, lattices and bounds for commutative group codes ⋮ Some constructions of superimposed codes in Euclidean spaces. ⋮ Linear programming bounds for codes in infinite projective spaces ⋮ Energy bounds for codes in polynomial metric spaces ⋮ Bounds for spherical codes: The Levenshtein framework lifted

This page was built for publication: Upper bounds on the minimum distance of spherical codes