By Topic

Generalized rational interpolation over commutative rings and remainder decoding

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
$33 $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

1 Author(s)
M. A. Armand ; Dept. of Electr. & Comput. Eng., Nat. Univ. of Singapore, Singapore

We propose a new decoding procedure for Bose-Chaudhuri-Hocquenghem (BCH) and Reed-Solomon (RS) codes over Zm where m is a product of prime powers. Our method generalizes the remainder decoding technique for RS codes originally introduced by Welch and Berlekamp and retains its key feature of not requiring the prior evaluation of syndromes. It thus represents a significant departure from other algorithms that have been proposed for decoding linear block codes over integer residue rings. Our decoding procedure involves a Welch-Berlekamp (WB)-type algorithm for solving a generalized rational interpolation problem over a commutative ring R with identity. The solution to this problem includes as a special case, the solution to the WB key equation over R which is central to our decoding procedure. A remainder decoding approach for decoding cyclic codes over Zm up to the Hartmann-Tzeng bound is also presented.

Published in:

IEEE Transactions on Information Theory  (Volume:50 ,  Issue: 4 )