๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Linear Programming Bounds for Codes via a Covering Argument

โœ Scribed by Michael Navon; Alex Samorodnitsky

Publisher
Springer
Year
2008
Tongue
English
Weight
289 KB
Volume
41
Category
Article
ISSN
0179-5376

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

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