Suboptimum decoding of decomposable block codes

DOI10.1109/18.333856MaRDI QIDQ4324110zbMATH OpenOpenAlexFDO

Authors Toyoo Takata, Yuji Yamashita, Toru Fujiwara, Tadao Kasami, Shu Lin

Publication date 1 March 1995

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

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

zbMATH Keywords

AWGN channelBCH-codeblock codedecodingdecomposable codeserror performancemultistage decodingReed-Muller codes

Mathematics Subject Classification ID

Cyclic codes (94B15) Decoding (94B35) Other types of codes (94B60)

Recommendations

• Some decomposable codes: the |a+x|b+x|a+b+x| construction
• scientific article; zbMATH DE number 493106
• Suboptimal decoding of linear codes: partition technique
• Decoding linear block codes using a priority-first search: performance analysis and suboptimal version
• Soft-decision decoding of Reed-Muller codes: a simplified algorithm

Cited in

(5)

• Suboptimal decoding of linear codes: partition technique
• Design of efficient codes for the AWGN channel based on decomposable binary lattices
• Some decomposable codes: the |a+x|b+x|a+b+x| construction
• On the Decoding Performance of Spatially Coupled LDPC Codes With Sub-Block Access
• Completely decomposable rank-metric codes

This page was built for publication: Suboptimum decoding of decomposable block codes

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