DocumentCode :
926707
Title :
Explicit evaluation of Viterbi´s union bounds on convolutional code performance for the binary symmetric channel (Corresp.)
Author :
Post, Karel A.
Volume :
23
Issue :
3
fYear :
1977
fDate :
5/1/1977 12:00:00 AM
Firstpage :
403
Lastpage :
404
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 rate 
code with generators 
and 
. Comparison is made with the bounds and experimental results of van de Meeberg.
code with generators and . Comparison is made with the bounds and experimental results of van de Meeberg.Keywords :
Convolutional codes; Viterbi decoding; Convolutional codes; Error analysis; Error correction codes; Error probability; Information theory; Polynomials; Probability distribution; Reed-Solomon codes; Taylor series; Viterbi algorithm;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.1977.1055704
Filename :
1055704
Link To Document :
