Low-Complexity Soft-Decoding Algorithms for Reed–Solomon Codes—Part I: An Algebraic Soft-In Hard-Out Chase Decoder

DOI10.1109/TIT.2009.2039073MaRDI QIDQ5281556zbMATH OpenOpenAlexFDO

Authors Jason Bellorado, Aleksandar Kavčić

Publication date 27 July 2017

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

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

Mathematics Subject Classification ID

Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Decoding (94B35)

Cited in

(3)

• Iterative Algebraic Soft-Decision List Decoding of Reed-Solomon Codes
• Performance Analysis of Algebraic Soft-Decision Decoding of Reed–Solomon Codes
• Low-Complexity Soft-Decoding Algorithms for Reed–Solomon Codes—Part II: Soft-Input Soft-Output Iterative Decoding

This page was built for publication: Low-Complexity Soft-Decoding Algorithms for Reed–Solomon Codes—Part I: An Algebraic Soft-In Hard-Out Chase Decoder

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