Linear Diophantine Equations Over Polynomials and Soft Decoding of Reed–Solomon Codes

DOI10.1109/TIT.2005.850097zbMath1282.94101MaRDI QIDQ3546485

Michael Alekhnovich

Publication date: 21 December 2008

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Polynomials in general fields (irreducibility, etc.) (12E05) Decoding (94B35)

Related Items (16)

Computing minimal interpolation bases ⋮ List decoding of repeated codes ⋮ Multi-trial Guruswami-Sudan decoding for generalised Reed-Solomon codes ⋮ Special issue in memory of Misha Alekhnovich. Foreword ⋮ Polynomial root finding over local rings and application to error correcting codes ⋮ Amplification and Derandomization without Slowdown ⋮ Interpolation in list decoding of Reed-Solomon codes ⋮ A Syndrome Formulation of the Interpolation Step in the Guruswami-Sudan Algorithm ⋮ List decoding of Reed-Solomon codes from a Gröbner basis perspective ⋮ Decoding interleaved Gabidulin codes using Alekhnovich's algorithm ⋮ Row reduction applied to decoding of rank-metric and subspace codes ⋮ Key equations for list decoding of Reed-Solomon codes and how to solve them ⋮ Power decoding Reed-Solomon codes up to the Johnson radius ⋮ Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding ⋮ Simplified High-Speed High-Distance List Decoding for Alternant Codes ⋮ Bezout-like polynomial equations associated with dual univariate interpolating subdivision schemes

This page was built for publication: Linear Diophantine Equations Over Polynomials and Soft Decoding of Reed–Solomon Codes