✦ LIBER ✦

Linear programming bounds for codes in grassmannian spaces

✍ Scribed by Bachoc, C.

Book ID: 114640219
Publisher: IEEE
Year: 2006
Tongue: English
Weight: 418 KB
Volume: 52
Category: Article
ISSN: 0018-9448
DOI: 10.1109/tit.2006.872973

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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 tree codes

Linear programming bounds for tree codes (Corresp.)

✍ Aaltonen, M. 📂 Article 📅 1979 🏛 IEEE 🌐 English ⚖ 936 KB

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

Codes and designs in Grassmannian spaces

✍ Christine Bachoc; Eiichi Bannai; Renaud Coulangeon 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 252 KB

Linear programming bounds for doubly-eve

Linear programming bounds for doubly-even self-dual codes

✍ Krasikov, I.; Litsyn, S. 📂 Article 📅 1997 🏛 IEEE 🌐 English ⚖ 441 KB