A low-rate bound for asymmetric error-correcting codes (Corresp.)
J. Martin Borden · IEEE Transactions on Information Theory · 1983
We prove a Plotkin-type bound for binary codes which correct asymmetric errors. This bound shows that it is possible to correct as many as1/3asymmetric errors per code symbol, and no more. The result is obtained by estimating the solution of a linear program.