𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Improved Linear Programming Bounds for Antipodal Spherical Codes

✍ Scribed by Anstreicher

Publisher
Springer
Year
2002
Tongue
English
Weight
78 KB
Volume
28
Category
Article
ISSN
0179-5376

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