Loading [a11y]/accessibility-menu.js
Bounds and constructions for binary asymmetric error-correcting codes (Corresp.) | IEEE Journals & Magazine | IEEE Xplore

Bounds and constructions for binary asymmetric error-correcting codes (Corresp.)


Abstract:

By use of known bounds on constant-weight binary codes, new uppper bounds are obtained on the cardinality of binary codes correcting asymmetric errors. Some constructions...Show More

Abstract:

By use of known bounds on constant-weight binary codes, new uppper bounds are obtained on the cardinality of binary codes correcting asymmetric errors. Some constructions are exhibited that come close to these bounds. For single-error-correcting codes some constructions are derived from the Steiner systemS(5, 6,12), and for double-error-correcting codes some constructions are derived from the Nordstrom-Robinson code.
Published in: IEEE Transactions on Information Theory ( Volume: 27, Issue: 1, January 1981)
Page(s): 125 - 128
Date of Publication: 06 January 2003

ISSN Information:


References

References is not available for this document.