DocumentCode
914470
Title
On the minimum distance of certain reversible cyclic codes (Corresp.)
Author
Hartmann, C.
Volume
16
Issue
5
fYear
1970
fDate
9/1/1970 12:00:00 AM
Firstpage
644
Lastpage
646
Abstract
The minimum distance of a class of reversible cyclic codes has been proved to be greater than that given by the BCH bound. It is also noted that this class of codes includes the class of primitive double-error-correcting binary codes of Melas as well as the class of nonprimitive double-error-correcting binary codes discovered by Zetterberg as special cases.
Keywords
Cyclic codes; Binary codes; Councils; Decoding; Error correction; Error correction codes; Information retrieval; Memory; Network address translation; Testing; Upper bound;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/TIT.1970.1054517
Filename
1054517
Link To Document