A new analysis of the computational effort and the error probability of sequential decoding is
presented, which is based entirely on the distance properties of a particular convolutional …

This paper presents several results involving Fano's sequential decoding algorithm for
convolutional codes. An upper bound to the a th moment of decoder computation is obtained …

The best asymptotic bounds presently known on free distance for convolutional codes are
presented from a unified point of view. Upper and lower bounds for both time-varying and …

Three optimality criteria for convolutional codes are considered in this correspondence:
namely, free distance, minimum distance, and distance profile. Here we report the results of …

High rate convolutional codes with good distance profiles (Corresp.) Page 1
CORRESPONDENCE 615 TABLE II CONCATENATEDCODESOFLENGTH~~~ANDLESSWITHLARGER …

We study a serially interleaved concatenated code construction, where the outer code is a
standard convolutional code, and the inner code is a recursive convolutional code of rate 1 …

Upper and lower bounds on error probability for systematic convolutional codes are
obtained. These bounds show that the probability of error for a systematic convolutional …

In the past, criteria for predicting the performance of individual codes with sequential
decoding have been intuitive. In this paper, simple tests are derived that allow easy …

An improved upper bound on the error probability (first error event) of time-invariant
convolutional codes, and the resulting error exponent, is derived. The improved error bound …

Although sequential decoding of convolutional codes gives a very small decoding error
probability, the overall reliability is limited by the probability PG of deficient decoding, the …