Modified Low-Complexity Chase Soft-Decision Decoder of Reed---Solomon Codes
Journal of Signal Processing Systems
Fast generalized minimum-distance decoding of algebraic-geometry and Reed-Solomon codes
IEEE Transactions on Information Theory
Efficient decoding of Reed-Solomon codes beyond half the minimum distance
IEEE Transactions on Information Theory
Class of algorithms for decoding block codes with channel measurement information
IEEE Transactions on Information Theory
An adaptive two-stage algorithm for ML and sub-ML decoding of binary linear block codes
IEEE Transactions on Information Theory
Algebraic soft-decision decoding of Reed-Solomon codes
IEEE Transactions on Information Theory
An efficient maximum-likelihood-decoding algorithm for linear block codes with algebraic decoder
IEEE Transactions on Information Theory
Soft-decision decoding of linear block codes based on ordered statistics
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
Given a received polynomial rx with coefficients in finite field soft decision decoding SDD is the process of identifying the most probable error polynomial ex with coefficients in finite field and hence the corresponding code polynomial cx ∈{C x}, where {C x} is the code set. The paper presents an algorithm for identifying this cx - called the target code word TCW here - and extends the same to identify the list of codewords as well. The uniqueness of the approach lies in identifying the TCW directly without the need for search over a much larger set as with many of the existing methods. The proposed method seeks codewords with the most likely error positions guessed in advance; this ushers in a further simplification with cyclic codes obviating the need for repeated algebraic decoding. The fact that restricting the error correcting range to dmin - 1 yields a unique decoded codeword, leads to a practical implementation of the said algorithm with attendant superiority in performance.