New lower bounds and constructions for binary codes correcting asymmetric errors
Date of Issue2003
School of Physical and Mathematical Sciences
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.
DRNTU::Engineering::Computer science and engineering::Data::Coding and information theory
IEEE transactions on information theory
© 2003 IEEE. This is the author created version of a work that has been peer reviewed and accepted for publication by IEEE Transactions on Information Theory, IEEE. It incorporates referee’s comments but changes resulting from the publishing process, such as copyediting, structural formatting, may not be reflected in this document. The published version is available at: [http://dx.doi.org/10.1109/TIT.2003.820028].