Linear Programming Bounds for Codes of Small Size

✍ Scribed by Ilia Krasikov; Simon Litsyn

• Publisher: Elsevier Science
• Year: 1997
• Tongue: English
• Weight: 255 KB
• Volume: 18
• Category: Article
• ISSN: 0195-6698
• DOI: 10.1006/eujc.1996.0129

✦ Synopsis

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 proportional to n

improves on the earlier known results .