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 …

The probability of error in decoding an optimal convolutional code transmitted over a
memoryless channel is bounded from above and below as a function of the constraint length …

This thesis presents upper and lower bounds to the probability of error for convolutional
codes. The lower bound is derived for an optimum decoder with convolutional codes in …

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 …

A sequential decoder for linear block codes that performs maximum-likelihood soft-decision
decoding is described. The decoder uses a metric computed from a lower bound on the cost …

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 …

Sequential decoding is characterized as a sequential search for the shortest path through a
trellis. An easily analyzed algorithm closely related to the stack and Fano algorithms is …

A recursive procedure is derived for decoding of rate R= 1/n binary convolutional codes
which minimizes the probability of the individual decoding decisions for each information bit …

Iterative decoding of two-dimensional systematic convolutional codes has been termed"
turbo"(de) coding. Using log-likelihood algebra, we show that any decoder can be used …

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 …