DocumentCode
1304308
Title
More binary covering codes are normal
Author
van Wee, G.J.M.
Author_Institution
Dept. of Math. & Comput. Sci., Eindhoven Univ. of Technol.
Volume
36
Issue
6
fYear
1990
fDate
11/1/1990 12:00:00 AM
Firstpage
1466
Lastpage
1470
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;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/18.59947
Filename
59947
Link To Document