Title :
Normal and abnormal codes
Author :
Etzion, Tuvi ; Greenberg, Gadi ; Honkala, Iiro S.
Author_Institution :
Technion, Haifa, Israel
fDate :
7/1/1993 12:00:00 AM
Abstract :
It is proved that codes of length n, covering radius R, and minimum Hamming distance 2R-1 are normal if R does not divide n. Constructions for abnormal codes with covering radius R and minimum Hamming distance at least R-1 are given
Keywords :
BCH codes; Hamming codes; error correction codes; BCH code; Hamming code; abnormal codes; covering radius; minimum Hamming distance; normal codes; quasi-perfect code; Computer science; Error correction codes; Hamming distance; Mathematics;
Journal_Title :
Information Theory, IEEE Transactions on
