Collaborative Decoding of Interleaved Reed–Solomon Codes and Concatenated Code Designs

DOI10.1109/TIT.2009.2021308zbMath1367.94446arXivcs/0610074OpenAlexW2132376394MaRDI QIDQ4975910

Vladimir Sidorenko, Georg Schmidt, Martin Bossert

Publication date: 8 August 2017

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

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

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Decoding (94B35)

Related Items (14)

Improved probabilistic decoding of interleaved Reed-Solomon codes and folded Hermitian codes ⋮ Fractional decoding of \(r\)-Hermitian codes ⋮ Multitrial decoding of concatenated codes using fixed thresholds ⋮ Asymptotic single-trial strategies for GMD decoding with arbitrary error-erasure tradeoff ⋮ Bounds on collaborative decoding of interleaved Hermitian codes and virtual extension ⋮ Fast skew-feedback shift-register synthesis ⋮ On multi-trial Forney-Kovalev decoding of concatenated codes ⋮ Decoding interleaved Reed-Solomon codes beyond their joint error-correcting capability ⋮ Improved power decoding of interleaved one-point Hermitian codes ⋮ On syndrome decoding of punctured Reed-Solomon and Gabidulin codes ⋮ A linear algebraic approach to multisequence shift-register synthesis ⋮ Power error locating pairs ⋮ Simultaneous rational function reconstruction with errors: handling multiplicities and poles ⋮ Decoding of repeated-root cyclic codes up to new bounds on their minimum distance

This page was built for publication: Collaborative Decoding of Interleaved Reed–Solomon Codes and Concatenated Code Designs