Title :
On systematic single asymmetric error-correcting codes
Author :
Bose, Bella ; Al-Bassam, Sulaiman A.
Author_Institution :
Dept. of Comput. Sci., Oregon State Univ., Corvallis, OR, USA
fDate :
3/1/2000 12:00:00 AM
Abstract :
It is proved that for all values of code length n, except when n=2, 4, and 8 and possibly when n=2r and n=2r+1, where r⩾1, the Hamming codes are also optimal systematic single asymmetric error-correcting codes. For the cases n=2r and n=2 r+1, r⩾4, when not all information words are used, two efficient systematic 1-asymmetric codes are described
Keywords :
Hamming codes; error correction codes; Hamming codes; code length; information words; optimal systematic codes; systematic single asymmetric error-correcting codes; upper bound; Binary sequences; Computer errors; Computer science; Error correction codes; Information rates; Length measurement; Minerals; Petroleum; Sufficient conditions; Upper bound;
Journal_Title :
Information Theory, IEEE Transactions on
