We prove a Plotkin-type bound for binary codes which correct asymmetric errors. This bound shows that it is possible to correct as many as

asymmetric errors per code symbol, and no more. The result is obtained by estimating the solution of a linear program.