Please use this identifier to cite or link to this item:
|Title:||Generalized rational interpolation over commutative rings and remainder decoding||Authors:||Armand, M.A.||Keywords:||Commutative rings
|Issue Date:||Apr-2004||Citation:||Armand, M.A. (2004-04). Generalized rational interpolation over commutative rings and remainder decoding. IEEE Transactions on Information Theory 50 (4) : 683-690. ScholarBank@NUS Repository. https://doi.org/10.1109/TIT.2004.825002||Abstract:||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.||Source Title:||IEEE Transactions on Information Theory||URI:||http://scholarbank.nus.edu.sg/handle/10635/84409||ISSN:||00189448||DOI:||10.1109/TIT.2004.825002|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Apr 1, 2020
WEB OF SCIENCETM
checked on Mar 24, 2020
checked on Mar 29, 2020
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.