How often is hard-decision decoding enough?

DOI10.1109/18.669278MaRDI QIDQ4400337zbMATH OpenOpenAlexFDO

Authors

Publication date 2 August 1998

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

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

zbMATH Keywords

hard-decision decodingdecoding of block codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Decoding (94B35)

Recommendations

• Hard- and soft-decision decoding beyond the half minimum distance---An algorithm for linear codes (Corresp.)
• scientific article; zbMATH DE number 493101
• Computationally efficient soft-decision decoding of linear block codes based on ordered statistics
• Soft-decision decoding of linear block codes based on ordered statistics

Cited in

(4)

• On hard-decision decoding of product codes
• Is Non-Unique Decoding Necessary?
• Hard- and soft-decision decoding beyond the half minimum distance---An algorithm for linear codes (Corresp.)
• Optimal soft decision block decoders based on fast Hadamard transform

This page was built for publication: How often is hard-decision decoding enough?

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