Reduced GMD decoding

DOI10.1109/TIT.2003.809504MaRDI QIDQ4680068zbMATH OpenFDO

Authors J. H. Weber, Khaled Abdel-Ghaffar

Publication date 1 June 2005

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

Full work available at URL https://doi.org/10.1109/TIT.2003.809504

Mathematics Subject Classification ID

Decoding (94B35)

Recommendations

• scientific article; zbMATH DE number 4112538
• Multitrial decoding of concatenated codes using fixed thresholds
• Asymptotic single-trial strategies for GMD decoding with arbitrary error-erasure tradeoff
• scientific article; zbMATH DE number 4104869
• An improvement to generalized-minimum-distance decoding

Cited in

(6)

• Asymptotic single-trial strategies for GMD decoding with arbitrary error-erasure tradeoff
• On multi-trial Forney-Kovalev decoding of concatenated codes
• An improvement to generalized-minimum-distance decoding
• scientific article; zbMATH DE number 4104869 (Why is no real title available?)
• scientific article; zbMATH DE number 4112538 (Why is no real title available?)
• Multitrial decoding of concatenated codes using fixed thresholds

This page was built for publication: Reduced GMD decoding

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