New lower bounds and constructions for binary codes correcting asymmetric errors
In this correspondence, we study binary asymmetric error-correcting codes. A general construction for binary asymmetric error-correcting codes is. presented. We show that some previously known lower bounds for binary asymmetric error-correcting codes can be obtained from this general construction. Furthermore, some new lower bounds for binary asymmetric error-correcting codes are obtained from this general construction. These new lower bounds improve the existing ones.
lower bounds asymmetric error-correcting codes code construction polynomials