A Tightened Upper Bound on the Error Probability of Binary Convolutional Codes with Viterbi Decoding
From MaRDI portal
Publication:4048924
DOI10.1109/TIT.1974.1055216zbMath0295.94019MaRDI QIDQ4048924
Publication date: 1974
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Information theory (general) (94A15) Theory of error-correcting codes and error-detecting codes (94B99)
Related Items (2)
Unnamed Item ⋮ 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