Linear programming bounds for codes in infinite projective spaces

DOI10.1007/BF01225671zbMath0938.94019OpenAlexW3158660333MaRDI QIDQ1818899

Maria Mitradjieva, Danyo Danev, P. G. Boyvalenkov

Publication date: 19 June 2000

Published in: Journal of Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01225671

zbMATH Keywords

projective spacescardinalityminimum distancecodesuniversal linear programminguniversal programming bounds

Mathematics Subject Classification ID

Linear programming (90C05) Bounds on codes (94B65) Linear codes and caps in Galois spaces (51E22)

Cites Work

• t-designs in projective spaces
• Parameters of t-designs in \({\mathbb{F}}P^{d-1}\)
• \(t\)-designs with general angle set
• Designs as maximum codes in polynomial metric spaces
• On linear programming bounds for codes in polynomial metric spaces
• Extremal polynomials for obtaining bounds for spherical codes and designs
• Two-point homogeneous spaces
• Lower bounds on the maximum cross correlation of signals (Corresp.)
• Upper bounds on the minimum distance of spherical codes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Linear programming bounds for codes in infinite projective spaces