Normal and abnormal codes
Tuvi Etzion, Gabriel Greenberg, Iiro S. Honkala · IEEE Transactions on Information Theory · 1993
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.>