On the Average Complexity of Reed–Solomon List Decoders

DOI10.1109/TIT.2012.2235522zbMATH Open1364.94707OpenAlexW2016629078MaRDI QIDQ2989321FDOQ2989321

Authors: Yuval Cassuto, Jehoshua Bruck, Robert J. McEliece 

Publication date: 8 June 2017

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

Full work available at URL: https://doi.org/10.1109/tit.2012.2235522

Mathematics Subject Classification ID

Decoding (94B35)

Cited In (3)

• Multi-trial Guruswami-Sudan decoding for generalised Reed-Solomon codes
• On the complexity of decoding Reed-Solomon codes (Corresp.)
• Combinatorial Limitations of Average-Radius List Decoding

This page was built for publication: On the Average Complexity of Reed–Solomon List Decoders

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2989321)