Syndrome Decoding of Reed–Solomon Codes Beyond Half the Minimum Distance Based on Shift-Register Synthesis

DOI10.1109/TIT.2010.2060130zbMath1366.94722arXivcs/0702130MaRDI QIDQ5281273

Georg Schmidt, Vladimir Sidorenko, Martin Bossert

Publication date: 27 July 2017

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

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

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cyclic codes (94B15) Decoding (94B35)

Related Items (13)

Power Decoding of Reed–Solomon Codes Revisited ⋮ Structural properties of self-dual monomial codes with application to code-based cryptography ⋮ Distinguishing and recovering generalized linearized Reed-Solomon codes ⋮ Algorithms for simultaneous Hermite-Padé approximations ⋮ Bounds on collaborative decoding of interleaved Hermitian codes and virtual extension ⋮ Fast skew-feedback shift-register synthesis ⋮ Decoding interleaved Reed-Solomon codes beyond their joint error-correcting capability ⋮ A Syndrome Formulation of the Interpolation Step in the Guruswami-Sudan Algorithm ⋮ Improved power decoding of interleaved one-point Hermitian codes ⋮ A lattice-based minimal partial realization algorithm for matrix sequences of varying length ⋮ Power decoding Reed-Solomon codes up to the Johnson radius ⋮ A linear algebraic approach to multisequence shift-register synthesis ⋮ Power error locating pairs

This page was built for publication: Syndrome Decoding of Reed–Solomon Codes Beyond Half the Minimum Distance Based on Shift-Register Synthesis