✦ LIBER ✦

Linear programming bounds for tree codes (Corresp.)

✍ Scribed by Aaltonen, M.

Book ID: 114634815
Publisher: IEEE
Year: 1979
Tongue: English
Weight: 936 KB
Volume: 25
Category: Article
ISSN: 0018-9448
DOI: 10.1109/tit.1979.1056004

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Linear programming bounds for codes in g

Linear programming bounds for codes in grassmannian spaces

✍ Bachoc, C. 📂 Article 📅 2006 🏛 IEEE 🌐 English ⚖ 418 KB

Bounds for error-correcting codes (Corre

Bounds for error-correcting codes (Corresp.)

✍ Peterson, W. 📂 Article 📅 1962 🏛 IEEE 🌐 English ⚖ 53 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

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