Please use this identifier to cite or link to this item:
Title: Decoding for iterative reed-solomon coding schemes
Authors: Krachkovsky, V.Y. 
Lee, Y.X. 
Issue Date: 1997
Citation: Krachkovsky, V.Y., Lee, Y.X. (1997). Decoding for iterative reed-solomon coding schemes. IEEE Transactions on Magnetics 33 (5 PART 1) : 2740-2742. ScholarBank@NUS Repository.
Abstract: For high density data storage systems channel errors may appear in form of bursts. This error correlation can significantly degrade the bit error rate on the subsequent stages of data processing. To correct error bursts the interleaved Read-Solomon (RS) codes are used. Usually, after the deinterleaving, the received words are decoded one by one by the same error correction algorithm. In this paper, a novel approach for the decoding of interleaved codes is proposed. It is based on a notion of covering error locators that locate error positions in two or more adjacent words. To compute the covering error locator polynomial, a modification of the Berlekamp-Massey algorithm is proposed. It is shown that with a certain probability of failure the proposed algorithm can correct more errors than the designed error correction ability. The algorithm may also be useful in a more general case of interleaved coding schemes with both rows and columns encoded by RS code. © 1997 IEEE.
Source Title: IEEE Transactions on Magnetics
ISSN: 00189464
DOI: 10.1109/20.617715
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.


checked on Oct 4, 2022


checked on Sep 27, 2022

Page view(s)

checked on Sep 22, 2022

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.