Tighter bounds on the error probability of fixed convolutional codes

Abstract

In this paper, we introduce new upper bounds for the bit and burst error probabilities, when a convolutional code is used for transmission over a binary input, additive white Gaussian noise channel, and the decoder performs maximum likelihood decoding. The bounds are tighter than existing bounds, and non-trivial also for signal-to-noise ratios below the computational cutoff rate.

DOI: 10.1109/18.923750

Extracted Key Phrases

4 Figures and Tables

Cite this paper

@article{Engdahl2001TighterBO, title={Tighter bounds on the error probability of fixed convolutional codes}, author={Karin Engdahl and Kamil Sh. Zigangirov}, journal={IEEE Trans. Information Theory}, year={2001}, volume={47}, pages={1625-1630} }