Collaborative Decoding of Interleaved Reed–Solomon Codes and Concatenated Code Designs

Schmidt, G.; Sidorenko, Vladimir; Bossert, Martin

doi:10.1109/tit.2009.2021308

Cited by 92 publications

(151 citation statements)

References 24 publications

Supporting

Mentioning

148

Contrasting

Order By: Relevance

“…For IRS codes an efficient decoding algorithm was suggested in [12], which has only ℓ times the complexity of the Berlekamp-Massey algorithm for decoding one single RS code. The algorithm allows to correct at most r(ℓ) :…”

Section: Interleaved Reed-solomon Codesmentioning

confidence: 99%

“…The main idea of applying the IRS decoding algorithm from [12] (ii) Execution of z v attempts of IRS decodingÃ v with a different number of erased columns in each attempt, which yields a candidate list of at most size z v . Finally, the "best" candidateĀ v from this list has to be selected using some criterion and inserted intoĀ.…”

Section: Interleaved Reed-solomon Codesmentioning

confidence: 99%

“…Besides the 7 saved outer decoding attempts, the number of inner decodings can then be cut down by n o (ℓ − 1) = 255. Note that decoding one IRS code with ℓ interleaved RS codes with the algorithm from [12] has the same complexity as decoding the ℓ RS codes independently. Thus, our comparison of both constructions is fair in terms of complexity.…”

Section: Bzda With Outer Irs Codes Ie Outer Bd Decodingmentioning

confidence: 99%

“…The IRS decoding algorithm from [12] yields a decoding failure with some probability. However, this probability can be made small and is neglected here.…”

Section: Interleaved Reed-solomon Codesmentioning

confidence: 99%

“…This idea is based on Interleaved Reed-Solomon (IRS) codes [10]. Other aspects of using IRS codes in concatenated codes were considered in [11], [12].…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Decoding generalized concatenated codes using Interleaved Reed-Solomon codes

Senger

Sidorenko

Bossert

et al. 2008

2008 IEEE International Symposium on Information Theory

Self Cite

View full text Add to dashboard Cite

Abstract-Generalized Concatenated codes are a code construction consisting of a number of outer codes whose code symbols are protected by an inner code. As outer codes, we assume the most frequently used Reed-Solomon codes; as inner code, we assume some linear block code which can be decoded up to half its minimum distance. Decoding up to half the minimum distance of Generalized Concatenated codes is classically achieved by the Blokh-Zyablov-Dumer algorithm, which iteratively decodes by first using the inner decoder to get an estimate of the outer code words and then using an outer error/erasure decoder with a varying number of erasures determined by a set of precalculated thresholds. In this paper, a modified version of the Blokh-Zyablov-Dumer algorithm is proposed, which exploits the fact that a number of outer Reed-Solomon codes with average minimum distanced can be grouped into one single Interleaved Reed-Solomon code which can be decoded beyondd/2. This allows to skip a number of decoding iterations on the one hand and to reduce the complexity of each decoding iteration significantly -while maintaining the decoding performance -on the other.

show abstract

Section: Interleaved Reed-solomon Codesmentioning

confidence: 99%

Section: Interleaved Reed-solomon Codesmentioning

confidence: 99%

Section: Bzda With Outer Irs Codes Ie Outer Bd Decodingmentioning

confidence: 99%

“…The IRS decoding algorithm from [12] yields a decoding failure with some probability. However, this probability can be made small and is neglected here.…”

Section: Interleaved Reed-solomon Codesmentioning

confidence: 99%

“…This idea is based on Interleaved Reed-Solomon (IRS) codes [10]. Other aspects of using IRS codes in concatenated codes were considered in [11], [12].…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Decoding generalized concatenated codes using Interleaved Reed-Solomon codes

Senger

Sidorenko

Bossert

et al. 2008

2008 IEEE International Symposium on Information Theory

Self Cite

View full text Add to dashboard Cite

show abstract

Collaborative algebraic decoding of interleaved Reed–Solomon codes

Shayegh

Soleymani

2011

Trans. Emerging Tel. Tech.

View full text Add to dashboard Cite

We derive and analyse an algorithm for collaborative decoding of heterogeneous interleaved Reed–Solomon (IRS) codes. They are generated by interleaving several codewords from different Reed–Solomon codes with the same length over the same Galois field. The basis of the decoding algorithm is similar to the Guruswami–Sudan (GS) decoding method. However, here multivariate interpolation is used to decode all the codewords of the interleaved scheme simultaneously. In the presence of burst errors, we show that the error‐correction capability of this algorithm is larger than that of independent decoding of each codeword using the standard GS method. In the latter case, the error‐correction capability is equal to the decoding radius of the GS algorithm for the Reed–Solomon code with the largest dimension. Also, concatenated codes using IRS codes as their outer codes and binary linear block codes as their inner codes are considered. Assuming maximum likelihood decoding of the inner code, we derive upper and lower bounds for the word error probability of concatenated codes over additive white Gaussian noise channel with binary phase‐shift keying modulation for both cases of independent and collaborative decoding of the outer IRS codes. We show that collaborative decoding provides considerable coding gain compared with independent decoding. Copyright © 2011 John Wiley & Sons, Ltd.

show abstract

Enabling resilient P2P video streaming: survey and analysis

et al. 2011

View full text Add to dashboard Cite

Peer-to-Peer (P2P) techniques for multimedia streaming have been shown to be a good enhancement to the traditional client/server methods when trying to reduce costs and increase robustness. Due to the fact that P2P systems are highly dynamic, the main challenge that has to be addressed remains supporting the general resilience of the system. Various challenges arise when building a resilient P2P streaming system, such as network failures and system dynamics. In this paper, we first classify the different challenges that face P2P streaming and then present and analyze the possible countermeasures. We classify resilience mechanisms as either core mechanisms, which are part of the system, or as cross-layer mechanisms that use information from different communication layers, which might inflict additional costs. We analyze and present resilience mechanisms from an engineering point of view, such that a system engineer can use our analysis as a guide to build a resilient P2P streaming system with different mechanisms and for various application scenarios.

show abstract

Collaborative Decoding of Interleaved Reed–Solomon Codes and Concatenated Code Designs

Cited by 92 publications

References 24 publications

Decoding generalized concatenated codes using Interleaved Reed-Solomon codes

Decoding generalized concatenated codes using Interleaved Reed-Solomon codes

Collaborative algebraic decoding of interleaved Reed–Solomon codes

Enabling resilient P2P video streaming: survey and analysis

Contact Info

Product

Resources

About