Algebraic Soft-Decision Decoding of Hermitian Codes
From MaRDI portal
Abstract: 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-Solomon codes, to Hermitian codes. First we provide an algebraic foundation for soft-decision decoding. Then we present an interpolation algorithm finding 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-Solomon codes, favorable to the former.
Cited in
(11)- Incremental numerical recipes for the high efficient inversion of the confluent Vandermonde matrices
- Hermitian codes and complete intersections
- Minimum rank (skew) Hermitian solutions to the matrix approximation problem in the spectral norm
- Minimum-weight codewords of the Hermitian codes are supported on complete intersections
- Recursive numerical recipes for the high efficient inversion of the confluent Vandermonde matrices
- Improved probabilistic decoding of interleaved Reed-Solomon codes and folded Hermitian codes
- On the geometry of Hermitian one-point codes
- A general preconditioner for linear complementarity problem with an \(M\)-matrix
- Fractional decoding of \(r\)-Hermitian codes
- Numerical recipes for the high efficient inverse of the confluent Vandermonde matrices
- Small-weight codewords of algebraic geometry codes
This page was built for publication: Algebraic Soft-Decision Decoding of Hermitian Codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5281437)
