Explicit evaluation of Viterbi's union bounds on convolutional code performance for the binary symmetric channel (Corresp.)
- 1 May 1977
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 23 (3), 403-404
- https://doi.org/10.1109/tit.1977.1055704
Abstract
An explicit method is given to evaluate Viterbi's union bounds on both the first event error probability and the bit error probability of binary convolutional codes on a binary symmetric channel. These bounds are evaluated for the rate1/2code with generators1 + D + D^{2}and1 + D^{2}. Comparison is made with the bounds and experimental results of van de Meeberg.Keywords
This publication has 12 references indexed in Scilit:
- Tree encoding of speechIEEE Transactions on Information Theory, 1975
- Worst sources and robust codes for difference distortion measuresIEEE Transactions on Information Theory, 1975
- A Tightened Upper Bound on the Error Probability of Binary Convolutional Codes with Viterbi DecodingIEEE Transactions on Information Theory, 1974
- Trellis Encoding of memoryless discrete-time sources with a fidelity criterionIEEE Transactions on Information Theory, 1974
- Optimum quantizers and permutation codesIEEE Transactions on Information Theory, 1972
- Computation of channel capacity and rate-distortion functionsIEEE Transactions on Information Theory, 1972
- Coding of sources with unknown statistics--II: Distortion relative to a fidelity criterionIEEE Transactions on Information Theory, 1972
- Convolutional Codes and Their Performance in Communication SystemsIEEE Transactions on Communication Technology, 1971
- Instrumentable tree encoding of information sources (Corresp.)IEEE Transactions on Information Theory, 1971
- Error bounds for convolutional codes and an asymptotically optimum decoding algorithmIEEE Transactions on Information Theory, 1967