Please use this identifier to cite or link to this item: https://doi.org/10.1109/TIT.2010.2040943
Title: A note on interleaved reedsolomon codes over galois rings
Authors: Armand, M.A. 
Keywords: Codes over rings
Collaborative decoding
Galois rings
Interleaved Reed-Solomon (RS) codes
Multisequence shift register synthesis
Issue Date: Apr-2010
Source: Armand, M.A. (2010-04). A note on interleaved reedsolomon codes over galois rings. IEEE Transactions on Information Theory 56 (4) : 1574-1581. ScholarBank@NUS Repository. https://doi.org/10.1109/TIT.2010.2040943
Abstract: Collaborative decoding of interleaved ReedSolomon (RS) codes was first proposed by Krachkovsky in 1997. Their work has since sparked off a series of papers from various authors on the subject. In this paper, we study the merits of multisequence-shift-register-synthesis-based collaborative decoding of interleaved RS codes formed from RS codes over Galois rings, in terms of key performance measures such as the probabilty of decoding failure and word error probability. In particular, we show that when ℓ is even and large but not exceeding ⌊(n-3+√n2-6n+1)/2, a qℓ-ary interleaved code formed from ℓ/2 parallel copies of a length-n RS code of rate greater than 1-(ℓ+3+(2/ℓ))/n over a Galois ring of cardinality q2, can be on par with its finite field counterpart formed from ℓ parallel copies of an RS code of the same length and rate over Fq, in terms of the word error probabilities of their respective decoders, while incurring lower decoding complexity. © 2006 IEEE.
Source Title: IEEE Transactions on Information Theory
URI: http://scholarbank.nus.edu.sg/handle/10635/81895
ISSN: 00189448
DOI: 10.1109/TIT.2010.2040943
Appears in Collections:Staff Publications

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

SCOPUSTM   
Citations

2
checked on Mar 27, 2018

WEB OF SCIENCETM
Citations

1
checked on Mar 27, 2018

Page view(s)

27
checked on Apr 20, 2018

Google ScholarTM

Check

Altmetric


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