New List Decoding Algorithms for Reed–Solomon and BCH Codes
From MaRDI portal
Publication:3604748
DOI10.1109/TIT.2008.926355zbMath1329.94103arXivcs/0703105OpenAlexW2066795426MaRDI QIDQ3604748
Publication date: 24 February 2009
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/cs/0703105
Related Items (9)
A modified Guruswami-Sudan algorithm for decoding Reed-Solomon codes ⋮ Minimal Gröbner bases and the predictable leading monomial property ⋮ Unnamed Item ⋮ The Performance of Concatenated Schemes Based on Non-binary Multithreshold Decoders ⋮ Improved power decoding of interleaved one-point Hermitian codes ⋮ List Decoding for Binary Goppa Codes ⋮ An iterative algorithm for parametrization of shortest length linear shift registers over finite chain rings ⋮ Power decoding Reed-Solomon codes up to the Johnson radius ⋮ Simplified High-Speed High-Distance List Decoding for Alternant Codes
This page was built for publication: New List Decoding Algorithms for Reed–Solomon and BCH Codes
