A Tightened Upper Bound on the Error Probability of Binary Convolutional Codes with Viterbi Decoding

DOI10.1109/TIT.1974.1055216zbMATH Open0295.94019MaRDI QIDQ4048924FDOQ4048924

Authors: L. van de Meeberg 

Publication date: 1974

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

Mathematics Subject Classification ID

Information theory (general) (94A15) Theory of error-correcting codes and error-detecting codes (94B99)

Cited In (2)

• New decoding error probability bounds for fixed convolutional codes used in BSC
• Theoretical and experimental upper and lower bounds on the efficiency of convolutional codes in a binary symmetric channel

This page was built for publication: A Tightened Upper Bound on the Error Probability of Binary Convolutional Codes with Viterbi Decoding

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