An Interpolation Procedure for List Decoding Reed–Solomon Codes Based on Generalized Key Equations

DOI10.1109/TIT.2011.2162160zbMath1365.94608arXiv1110.3898OpenAlexW3098977276MaRDI QIDQ5272372

Daniel Augot, Christian Gentner, Alexander Zeh

Publication date: 12 July 2017

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

Full work available at URL: https://arxiv.org/abs/1110.3898

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Decoding (94B35) Toeplitz, Cauchy, and related matrices (15B05) Software, source code, etc. for problems pertaining to information and communication theory (94-04)

Related Items (5)

Computing minimal interpolation bases ⋮ Multi-trial Guruswami-Sudan decoding for generalised Reed-Solomon codes ⋮ Algorithms for simultaneous Hermite-Padé approximations ⋮ Row reduction applied to decoding of rank-metric and subspace codes ⋮ Power decoding Reed-Solomon codes up to the Johnson radius

This page was built for publication: An Interpolation Procedure for List Decoding Reed–Solomon Codes Based on Generalized Key Equations