Loading [a11y]/accessibility-menu.js
Normal and abnormal codes | IEEE Journals & Magazine | IEEE Xplore

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 More

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)
Page(s): 1453 - 1456
Date of Publication: 06 August 2002

ISSN Information:


References

References is not available for this document.