The algebraic soft-decoding (ASD) of Reed– Solomon (RS) codes provides significant coding gain over hard-decision decoding with polynomial complexity. In order to reduce the complexity in this paper, high-throughput interpolator architecture for soft-decision decoding of Reed– Solomon (RS) codes based on low-complexity chase (LCC) decoding is presented. An efficiency is low, in terms of areadel...

This paper presents an adaptive hybrid Chase-like algorithm for Reed-Solomon codes, which is based on the list decoding algorithm. The adaptive hybrid algorithm is based on the reliability threshold to exclude the more reliable bits from being processed by the list decoding algorithm and reduce the complexity of the hybrid algorithm. Simulation results show that the decoding complexities of the...

A transform that enables generator-matrix-based Reed-Solomon (RS) coded data to be recovered under interpolation-based list decoding is presented. The transform matrix needs to be computed only once and the transformation of an element from the output list to the desired RS coded data block incurs k field multiplications, given a code of dimension k. Index Terms Galois Field Fourier Transform, ...

This paper presents an iterative decoding algorithm for concatenated codes consisting of a Reed-Solomon and a convolutional code, focusing on the code of the DVB-S standard. Existing solutions for the different decoding stages and their interfaces are discussed and their performance is compared. Besides, a new procedure is proposed to define the feedback signal from the output of the Reed-Solom...

The hull of a linear code is defined to be the intersection and its dual. When size small, it has been proved that some algorithms for checking permutation equivalence two codes computing automorphism group are very effective in general. Maximum distance separable (MDS) meeting Singleton bound. Twisted Reed-Solomon generalization codes, which also nice construction MDS codes. In this short lett...

In this paper, we present a new algorithm for decoding Reed-Solomon codes with both errors and erasures. The algorithm combines an efficient method for solving the Key Equation and a technique which separates the error locator polynomial from the erasure locator polynomial. The new algorithm is compared to two other efficient Reed-Solomon decoding algorithms and shown to be significantly faster...