On a method of calculating the event error probability of convolutional codes with maximum likelihood decoding (Corresp.)
- 1 November 1979
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 25 (6) , 737-743
- https://doi.org/10.1109/tit.1979.1056098
Abstract
Maximum likelihood (ML) decoding of short constraint length convolutional codes became feasible with the invention of the Viterbi decoder. Several authors have since upper bounded the performance of ML decoders. A method to calculate the event error probability of an ML decoder for convolutional codes is described.Keywords
This publication has 8 references indexed in Scilit:
- Syndrome decoding of binary-ratek/nconvolutional codesIEEE Transactions on Information Theory, 1978
- Explicit evaluation of Viterbi's union bounds on convolutional code performance for the binary symmetric channel (Corresp.)IEEE Transactions on Information Theory, 1977
- Syndrome Decoding of Binary Rate-1/2 Convolutional CodesIEEE Transactions on Communications, 1976
- Syndrome Decoding of Convolutional CodesIEEE Transactions on Communications, 1975
- A Tightened Upper Bound on the Error Probability of Binary Convolutional Codes with Viterbi DecodingIEEE Transactions on Information Theory, 1974
- Convolutional Codes and Their Performance in Communication SystemsIEEE Transactions on Communication Technology, 1971
- Convolutional codes I: Algebraic structureIEEE Transactions on Information Theory, 1970
- Analysis of decoders for convolutional codes by stochastic sequential machine methodsIEEE Transactions on Information Theory, 1970