Optimal soft decision block decoders based on fast Hadamard transform

DOI10.1109/TIT.1986.1057189MaRDI QIDQ3726009zbMATH OpenOpenAlexFDO

Authors Yair Be'ery, Jakov Snyders

Publication date 1986

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

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

zbMATH Keywords

decoding binary linear block codes

Mathematics Subject Classification ID

Decoding (94B35)

Recommendations

• A Recursive Hadamard Transform Optimal Soft Decision Decoding Algorithm
• Computationally efficient soft-decision decoding of linear block codes based on ordered statistics
• Decoding linear block codes using a priority-first search: performance analysis and suboptimal version
• How often is hard-decision decoding enough?
• scientific article; zbMATH DE number 493101

Cited in

(5)

• Fast decoding of non-binary first order Reed-Muller codes
• A Recursive Hadamard Transform Optimal Soft Decision Decoding Algorithm
• scientific article; zbMATH DE number 1750425 (Why is no real title available?)
• Hadamard-based soft decoding for vector quantization over noisy channels
• Reed-Muller Codes

This page was built for publication: Optimal soft decision block decoders based on fast Hadamard transform

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