Loading [a11y]/accessibility-menu.js
Minimum-distance bounds for binary linear codes | IEEE Journals & Magazine | IEEE Xplore

Minimum-distance bounds for binary linear codes


Abstract:

This paper presents a table of upper and lower bounds ond_{max} (n,k), the maximum minimum distance over all binary, linear(n,k)error-correcting codes. The table is obtai...Show More

Abstract:

This paper presents a table of upper and lower bounds ond_{max} (n,k), the maximum minimum distance over all binary, linear(n,k)error-correcting codes. The table is obtained by combining the best of the existing bounds ond_{max} (n,k)with the minimum distances of known codes and a variety of code-construction techniques.
Published in: IEEE Transactions on Information Theory ( Volume: 19, Issue: 3, May 1973)
Page(s): 344 - 356
Date of Publication: 06 January 2003

ISSN Information:


References

References is not available for this document.