DocumentCode
1339432
Title
Decoding Binary Cyclic Codes with Irreducible Generator Polynomials up to Actual Minimum Distance
Author
Lee, Chong-Dao ; Chang, Yaotsu ; Jing, Ming-Haw ; Chen, Jian-Hong
Author_Institution
Depts. of Commun. Eng., Appl. Math., Inf. Eng., & Inf. Eng., I-Shou Univ., Dashu Township, Taiwan
Volume
14
Issue
11
fYear
2010
fDate
11/1/2010 12:00:00 AM
Firstpage
1050
Lastpage
1052
Abstract
This letter presents two modified algorithms to decode up to actual minimum distance for binary cyclic codes with irreducible generator polynomials. The key ideas behind these decoding algorithms are the utilization of the extended Euclid´s algorithm for univariate polynomials to evaluate the unknown syndromes and the coefficients of general error locator polynomial, which has not been developed before. The advantage of these algorithms is particularly suitable for software and hardware implementations.
Keywords
binary codes; cyclic codes; decoding; polynomials; Euclid´s algorithm; decoding algorithms; decoding binary cyclic codes; general error locator polynomial; irreducible generator polynomials; univariate polynomials; Algorithm design and analysis; Decoding; Generators; Interpolation; Polynomials; Software algorithms; Cyclic code; extended Euclid´s algorithm; general error locator polynomial;
fLanguage
English
Journal_Title
Communications Letters, IEEE
Publisher
ieee
ISSN
1089-7798
Type
jour
DOI
10.1109/LCOMM.2010.092310.101111
Filename
5590334
Link To Document