✦ LIBER ✦

Spectral approach to linear programming bounds on codes

✍ Scribed by A. M. Barg; D. Yu. Nogin

Book ID: 110179711
Publisher: SP MAIK Nauka/Interperiodica
Year: 2006
Tongue: English
Weight: 424 KB
Volume: 42
Category: Article
ISSN: 0032-9460
DOI: 10.1134/s0032946006020025

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Upper Bounds on Permutation Codes via Li

Upper Bounds on Permutation Codes via Linear Programming

✍ H. Tarnanen 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 140 KB

Upper Bounds on Permutation Codes via Li

Upper Bounds on Permutation Codes via Linear Programming

✍ H. Tarnanen 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 140 KB

An upper bound on permutation codes of length n is given. This bound is a solution of a certain linear programming problem and is based on the well-developed theory of association schemes. Several examples are presented. For instance, the 255 values of the bound for n ≤ 8 are tabulated. It turns out

Linear programming bounds for tree codes

Linear programming bounds for tree codes (Corresp.)

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

On Linear Programming Bounds for Spheric

On Linear Programming Bounds for Spherical Codes and Designs

✍ Alex Samorodnitsky 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 159 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