✦ LIBER ✦

Linear programming bounds for codes in infinite projective spaces

✍ Scribed by Peter Boyvalenkov; Danyo Danev; Maria Mitradjieva

Publisher: Springer
Year: 1999
Tongue: English
Weight: 672 KB
Volume: 66
Category: Article
ISSN: 0047-2468
DOI: 10.1007/bf01225671

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Linear Programming Bounds for Codes of S

Linear Programming Bounds for Codes of Small Size

✍ Ilia Krasikov; Simon Litsyn 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 255 KB

Combining linear programming with the Plotkin -Johnson argument for constant weight codes , we derive upper bounds on the size of codes of length n and minimum distance 3 ) these bounds practically coincide with (are slightly better than) the Tieta ¨ va ¨ inen bound . For j fixed and for j proporti

Improved Linear Programming Bounds for A

Improved Linear Programming Bounds for Antipodal Spherical Codes

✍ Anstreicher 📂 Article 📅 2002 🏛 Springer 🌐 English ⚖ 78 KB

Linear Programming Bounds for Codes via

Linear Programming Bounds for Codes via a Covering Argument

✍ Michael Navon; Alex Samorodnitsky 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 289 KB

On Linear Programming Bounds for Spheric

On Linear Programming Bounds for Spherical Codes and Designs

✍ Alex Samorodnitsky 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 159 KB

Updating lower bounds when using Karmark

Updating lower bounds when using Karmarkar's projective algorithm for linear programming

✍ J. E. Mitchell 📂 Article 📅 1993 🏛 Springer 🌐 English ⚖ 641 KB

Algorithms for infinite quadratic progra

Algorithms for infinite quadratic programming in spaces

✍ Shen-Yu Chen; Soon-Yi Wu 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 208 KB