DocumentCode :
941144
Title :
On the minimum distance of cyclic codes
Author :
Van Lint, Jacobus H. ; Wilson, Richard M.
Volume :
32
Issue :
1
fYear :
1986
fDate :
1/1/1986 12:00:00 AM
Firstpage :
23
Lastpage :
40
Abstract :
The main result is a new lower bound for the minimum distance of cyclic codes that includes earlier bounds (i.e., BCH bound, HT bound, Roos bound). This bound is related to a second method for bounding the minimum distance of a cyclic code, which we call shifting. This method can be even stronger than the first one. For all binary cyclic codes of length 
(with two exceptions), we show that our methods yield the true minimum distance. The two exceptions at the end of our list are a code and its even-weight subcode. We treat several examples of cyclic codes of length 
.
(with two exceptions), we show that our methods yield the true minimum distance. The two exceptions at the end of our list are a code and its even-weight subcode. We treat several examples of cyclic codes of length .Keywords :
Cyclic coding; Graph theory; Information theory; Jacobian matrices; Mathematics; Paper technology; Parity check codes; Polynomials; Terminology;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.1986.1057134
Filename :
1057134
Link To Document :
