DocumentCode
1191078
Title
On binary cyclic codes of odd lengths from 101 to 127
Author
Schomaker, D. ; Wirtz, M.
Author_Institution
Math. Inst., Munster Univ., Germany
Volume
38
Issue
2
fYear
1992
fDate
3/1/1992 12:00:00 AM
Firstpage
516
Lastpage
518
Abstract
All binary cyclic codes of odd lengths are checked from 101 to 127 to find codes which are better than those in a table by T. Verhoeff (1989). There are five such cases, namely, (117, 36, 32), (117, 37, 29), (117, 42, 26), (117, 49, 24), and (127, 36 35) cyclic codes. According to Verhoeff´s table the previously known ranges of the highest minimum-distance were 28-40, 28-40, 25-37, 22-32, and 32-46, respectively. Applying constructions X and Y1, (120, 37, 32) and (108, 28, 32) codes were found. Moreover, the highest minimum-distances that cyclic codes of length 127 can attain are determined.<>
Keywords
error correction codes; binary cyclic codes; minimum-distance; odd lengths; Distributed computing; Linear code; Linear programming; Parity check codes; Testing;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/18.119714
Filename
119714
Link To Document