By Topic

Inversionless decoding of both errors and erasures of Reed-Solomon code

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

3 Author(s)
Trieu-Kien Truong ; Coll. of Electr. & Inf. Eng., I-Shou Univ., Ta-Hsu Hsiang, Taiwan ; Jeng, J.H. ; King-Chu Hung

Previously, the authors proposed an inverse-free Berlekamp-Massey (1968, 1969) algorithm to simplify the Reed-Solomon (RS) codes. This modified RS decoding method is the best known technique for finding the error locator polynomial. The inverse-free method is generalized to find both errors and erasures. The basic idea of the new procedure is the replacement of the initial condition of the BM algorithm by the Forney (1965) syndromes. With this improved technique, the complexity of time-domain RS decoders for correcting both errors and erasures is reduced substantially from previous approaches

Published in:

Communications, IEEE Transactions on  (Volume:46 ,  Issue: 8 )