Title :
New single asymmetric error-correcting codes
Author :
Al-Bassam, Sulaiman ; Venkatesan, Ramachandran ; Al-Muhammadi, Sultan
Author_Institution :
Dept. of Inf. & Comput. Sci., King Fahd Univ. of Pet. & Miner., Dhahran, Saudi Arabia
fDate :
9/1/1997 12:00:00 AM
Abstract :
New single asymmetric error-correcting codes are proposed. These codes are better than existing codes when the code length n is greater than 10, except for n=12 and n=15. In many cases one can construct a code C containing at least [2n/n] codewords. It is known that a code with |C|⩾[2n/(n+1)] can be easily obtained. It should be noted that the proposed codes for n=12 and n=15 are also the best known codes that can be explicitly constructed, since the best of the existing codes for these values of n are based on combinatorial arguments. Useful partitions of binary vectors are also presented
Keywords :
combinatorial mathematics; error correction codes; binary vectors; code length; codewords; combinatorial arguments; single asymmetric error-correcting codes; Computer science; Error correction codes; Hamming distance; Length measurement; Minerals; Noise measurement; Petroleum; Upper bound;
Journal_Title :
Information Theory, IEEE Transactions on
