Interpolation in list decoding of Reed-Solomon codes
From MaRDI portal
Publication:927473
DOI10.1134/S0032946007030027zbMath1136.94323MaRDI QIDQ927473
Publication date: 9 June 2008
Published in: Problems of Information Transmission (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Efficient computation of zero-dimensional Gröbner bases by change of ordering
- Gröbner bases of ideals defined by functionals with an application to ideals of projective points
- Linear Diophantine Equations Over Polynomials and Soft Decoding of Reed–Solomon Codes
- Algebraic soft-decision decoding of reed-solomon codes
- Improved decoding of Reed-Solomon and algebraic-geometry codes
- Efficient decoding of Reed-Solomon codes beyond half the minimum distance
This page was built for publication: Interpolation in list decoding of Reed-Solomon codes