✦ LIBER ✦

Strengthened semidefinite programming bounds for codes

✍ Scribed by Monique Laurent

Publisher: Springer-Verlag
Year: 2006
Tongue: English
Weight: 290 KB
Volume: 109
Category: Article
ISSN: 0025-5610
DOI: 10.1007/s10107-006-0030-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Strengthened existence and uniqueness co

Strengthened existence and uniqueness conditions for search directions in semidefinite programming

✍ Levent Tunçel; Henry Wolkowicz 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 378 KB

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 in i

Linear programming bounds for codes in infinite projective spaces

✍ Peter Boyvalenkov; Danyo Danev; Maria Mitradjieva 📂 Article 📅 1999 🏛 Springer 🌐 English ⚖ 672 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