On bit-error probability of a concatenated coding scheme

DOI10.1109/26.592553MaRDI QIDQ4361501zbMATH OpenOpenAlexFDO

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

Publication date 28 October 1997

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

Full work available at URL https://semanticscholar.org/paper/1eeb2f35813718b5ff9900c4321f43664f2a56dc

zbMATH Keywords

bit-error probabilityconcatenated coding systemmaximum likelihood decodingReed-MullerReed-Solomon codesoft-decision

Mathematics Subject Classification ID

Channel models (including quantum) in information and communication theory (94A40) Combined modulation schemes (including trellis codes) in coding theory (94B12) Error probability in coding theory (94B70)

Recommendations

• scientific article; zbMATH DE number 279460
• scientific article; zbMATH DE number 3417337
• Unveiling turbo codes: some results on parallel concatenated coding schemes
• scientific article; zbMATH DE number 1182528
• On decoding concatenated codes

Cited in

(6)

• scientific article; zbMATH DE number 3478752 (Why is no real title available?)
• Generalized concatenated codes for channels where unidirectional byte errors are predominant
• The capacity of orthogonal and bi-orthogonal codes on the Gaussian channel
• scientific article; zbMATH DE number 1182528 (Why is no real title available?)
• scientific article; zbMATH DE number 1420993 (Why is no real title available?)
• scientific article; zbMATH DE number 279460 (Why is no real title available?)

This page was built for publication: On bit-error probability of a concatenated coding scheme

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