Near-optimum decoding of product codes: Block turbo codes

DOI10.1109/26.705396MaRDI QIDQ2714799zbMATH OpenOpenAlexFDO

Authors Ramesh Mahendra Pyndiah

Publication date 16 August 2001

Published in IEEE Transactions on Communications (Search for Journal in Brave)

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

zbMATH Keywords

BCH codingblock codesblock turbo codeiterative decoding algorithmmaximum-likelihood decodingproduct codesequential decoding

Mathematics Subject Classification ID

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

Recommendations

• Iterative decoding of binary block and convolutional codes
• An efficient decoding algorithm for block turbo codes
• scientific article; zbMATH DE number 1182521
• scientific article; zbMATH DE number 2077096
• Codes and turbo codes

Cited in

(11)

• QAM modulations with \(q\)-ary turbo codes
• Convergence analysis of turbo decoding of serially concatenated block codes and product codes
• Adaptive SNR estimation algorithms for decoding block turbo codes
• An improved decoding algorithm for block turbo codes
• Soft-Output BEAST Decoding With Application to Product Codes
• scientific article; zbMATH DE number 1293741 (Why is no real title available?)
• An efficient decoding algorithm for block turbo codes
• Fast Chase algorithm with an application in turbo decoding
• On hard-decision decoding of product codes
• Reduced complexity iterative decoding of 3D-product block codes based on genetic algorithms
• Decoding algorithms for shortened-extended turbo product codes in WiMAX systems

This page was built for publication: Near-optimum decoding of product codes: Block turbo codes

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