DocumentCode
847281
Title
New lower bounds and constructions for binary codes correcting asymmetric errors
Author
Fu, Fang-Wei ; Ling, San ; Xing, Chaoping
Author_Institution
Dept. of Math., Nankai Univ., Tianjin, China
Volume
49
Issue
12
fYear
2003
Firstpage
3294
Lastpage
3299
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.
Keywords
binary codes; differentiation; error correction codes; polynomials; binary asymmetric error correcting codes; code construction; lower bound; polynomials; Binary codes; Chaotic communication; Educational programs; Error correction codes; Error probability; Laboratories; Mathematics; Optical computing; Optical fiber communication; Upper bound;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/TIT.2003.820028
Filename
1255557
Link To Document