New Efficient Constructions of Binary Asymmetric Error-Correcting Codes

Abstract

We study the new construction of binary asymmetric error-correcting codes presented by Fu, Ling and Xing. The direct construction algorithm requires ) 2 ( n n θ operations in all cases. In this paper, we first develop a construction algorithm which requires only ) 2 ( n θ operations in all cases. Next, we improve the algorithm by a bounding function. The final construction algorithm requires ) 2 ( n O operations in the worst case. In most cases, the number of operations is much lower than n 2 .