Title :
More binary covering codes are normal
Author_Institution :
Dept. of Math. & Comput. Sci., Eindhoven Univ. of Technol.
fDate :
11/1/1990 12:00:00 AM
Abstract :
It is shown that every optimal binary code with covering radius R=1 is normal. This (parity) proves a conjecture of Cohen, Lobstein, and Sloane (1986). It is also proved that codes with minimal distance 2R or 2R+1 are normal. A generalization of Frankl´s construction (1987) of abnormal codes is given
Keywords :
error correction codes; abnormal codes; binary covering codes; covering radius; minimal distance; normal codes; optimal binary code; Binary codes; Error correction codes; Extraterrestrial measurements; Hamming distance; Linear code; Mathematics; Notice of Violation; Vectors;
Journal_Title :
Information Theory, IEEE Transactions on
