Limited-trial chase decoding

DOI10.1109/TIT.2003.818397MaRDI QIDQ3546489zbMATH OpenOpenAlexFDO

Authors G. Aricò, J. H. Weber

Publication date 21 December 2008

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

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

Mathematics Subject Classification ID

Decoding (94B35)

Recommendations

• Limited-Trial Chase-Like Algorithms Achieving Bounded-Distance Decoding
• Chase-type and GMD coset decoding
• Asymptotic optimality of the GMD and Chase decoding algorithms
• Generalization of chase algorithms for soft decision decoding of binary linear codes
• Geometrical and performance analysis of GMD and Chase decoding algorithms

Cited in

(6)

• Chase-type and GMD coset decoding
• The search center of the Chase-like decoding algorithms
• Generalization of chase algorithms for soft decision decoding of binary linear codes
• Limited-Trial Chase-Like Algorithms Achieving Bounded-Distance Decoding
• Fast Chase algorithm with an application in turbo decoding
• The constructions of the minimum l-defeasible set

This page was built for publication: Limited-trial chase decoding

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