Weizmann Logo
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style

All reports by Author Michael Navon:

TR07-033 | 14th February 2007
Michael Navon, Alex Samorodnitsky

Linear programming bounds for codes via a covering argument

We recover the first linear programming bound of McEliece, Rodemich, Rumsey, and Welch for binary error-correcting codes and designs via a covering argument. It is possible to show, interpreting the following notions appropriately, that if a code has a large distance, then its dual has a small covering radius and, ... more >>>

ISSN 1433-8092 | Imprint