DocumentCode
1409995
Title
More on the minimum distance of cyclic codes
Author
de Rooij, N. P J ; Van Lint, J.J.
Author_Institution
PTT Research Neher Lab., Leidschendam, Netherlands
Volume
37
Issue
1
fYear
1991
fDate
1/1/1991 12:00:00 AM
Firstpage
187
Lastpage
189
Abstract
It was recently shown that the so-called Jensen bound is generally weaker than the product method and the shifting method introduced by van Lint and Wilson (1986). It is shown that the minimum distance of the two cyclic codes of length 65 (for which it is known that the product method does not produce the desired result) can be proved using Jensen´s method (1985) with some adaptations
Keywords
error correction codes; Jensen bound; cyclic codes; minimum distance; product method; shifting method; Algebra; Binary codes; Concatenated codes; Mathematics; Power generation; Terminology;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/18.61137
Filename
61137
Link To Document