Decoding of Reed Solomon codes beyond the error-correction bound
Journal of Complexity
A displacement approach to decoding algebraic codes
Contemporary mathematics
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
List decoding of Reed-Solomon codes from a Gröbner basis perspective
Journal of Symbolic Computation
Algebraic Function Fields and Codes
Algebraic Function Fields and Codes
List decoding of Hermitian codes using Gröbner bases
Journal of Symbolic Computation
List decoding of algebraic-geometric codes
IEEE Transactions on Information Theory
Improved decoding of Reed-Solomon and algebraic-geometry codes
IEEE Transactions on Information Theory
Efficient root-finding algorithm with application to list decoding of algebraic-geometric codes
IEEE Transactions on Information Theory
Algebraic soft-decision decoding of Reed-Solomon codes
IEEE Transactions on Information Theory
Reed-Solomon list decoding from a system-theoretic perspective
IEEE Transactions on Information Theory
Linear diophantine equations over polynomials and soft decoding of Reed-Solomon codes
IEEE Transactions on Information Theory
Exponential error bounds for algebraic soft-decision decoding of Reed-Solomon codes
IEEE Transactions on Information Theory
Improved probabilistic decoding of interleaved Reed-Solomon codes and folded Hermitian codes
Theoretical Computer Science
Hi-index | 754.84 |
An algebraic soft-decision decoder for Hermitian codes is presented. We apply Koetter and Vardy's soft-decision decoding framework, now well established for Reed-Solmon codes, to Hermitian codes. First we provide an algebraic foundation for soft-decision decoding. Then we present an interpolation algorithm to find the Q-polynomial that plays a key role in the decoding. With some simulation results, we compare performances of the algebraic soft-decision decoders for Hermitian codes and Reed-Solmon codes, favorable to the former.