By Topic

Decoding Binary Cyclic Codes with Irreducible Generator Polynomials up to Actual Minimum Distance

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Chong-Dao Lee ; Depts. of Commun. Eng., Appl. Math., Inf. Eng., & Inf. Eng., I-Shou Univ., Dashu Township, Taiwan ; Yaotsu Chang ; Ming-Haw Jing ; Jian-Hong Chen

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.

Published in:

Communications Letters, IEEE  (Volume:14 ,  Issue: 11 )