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 coverin...Show MoreMetadata
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.<>
Published in: IEEE Transactions on Information Theory ( Volume: 39, Issue: 4, July 1993)
DOI: 10.1109/18.243469