A posteriori probability decoding of convolutional codes

MaRDI QIDQ1569283zbMATH OpenFDO

Authors A. N. Trofimov, Kamil S. Zigangirov

Publication date 19 November 2001

Published in Problems of Information Transmission (Search for Journal in Brave)

zbMATH Keywords

computational complexityconvolutional codesa posteriori probability decoding schemeAPP decodingbit error probabilitymaximum a posteriori probability decodingMPP decoding

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Convolutional codes (94B10) Decoding (94B35) Error probability in coding theory (94B70)

Recommendations

• List decoding of convolutional codes
• Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
• Symbol error probability for convolutional codes
• A posteriori probability decoding of nonsystematically encoded block codes
• On the probability of error of convolutional codes

Cited in

(9)

• A truncated best-path algorithm
• A rate-\(k/n\) heuristic soft-output Viterbi algorithm (SOVA) that is postdetector-compatible
• Optimal subblock-by-subblock detection
• scientific article; zbMATH DE number 2115921 (Why is no real title available?)
• scientific article; zbMATH DE number 4077130 (Why is no real title available?)
• scientific article; zbMATH DE number 1867235 (Why is no real title available?)
• Alternative structure for computing APPs of the markov source
• A posteriori probability decoding of nonsystematically encoded block codes
• scientific article; zbMATH DE number 1928620 (Why is no real title available?)

This page was built for publication: A posteriori probability decoding of convolutional codes

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