Please use this identifier to cite or link to this item:
|Title:||New Lower Bounds and Constructions for Binary Codes Correcting Asymmetric Errors||Authors:||Fu, F.-W.
|Keywords:||Asymmetric error-correcting codes
|Issue Date:||Dec-2003||Citation:||Fu, F.-W., Ling, S., Xing, C. (2003-12). New Lower Bounds and Constructions for Binary Codes Correcting Asymmetric Errors. IEEE Transactions on Information Theory 49 (12) : 3294-3299+3351. ScholarBank@NUS Repository. https://doi.org/10.1109/TIT.2003.820028||Abstract:||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.||Source Title:||IEEE Transactions on Information Theory||URI:||http://scholarbank.nus.edu.sg/handle/10635/111445||ISSN:||00189448||DOI:||10.1109/TIT.2003.820028|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Apr 20, 2021
WEB OF SCIENCETM
checked on Apr 12, 2021
checked on Apr 11, 2021
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.