Improved linear programming bounds for antipodal spherical codes.

DOI10.1007/s00454-001-0080-5zbMath1175.90284OpenAlexW1995507179MaRDI QIDQ1611074

Kurt M. Anstreicher

Publication date: 20 August 2002

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00454-001-0080-5

Mathematics Subject Classification ID

Linear programming (90C05)

Related Items

Low dimensional strongly perfect lattices. II: Dual strongly perfect lattices of dimension 13 and 15., LOW-DIMENSIONAL STRONGLY PERFECT LATTICES. III: DUAL STRONGLY PERFECT LATTICES OF DIMENSION 14, On lattices whose minimal vectors form a 6-design