Bounds and constructions for binary asymmetric error-correcting codes (Corresp.)
P. Delsarte, Philippe Piret · IEEE Transactions on Information Theory · 1981
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.