A technique for estimating convolutional code performance on very noisy channels is
considered. Specifically, the performance of short constraint length codes operating near the …

Maximum likelihood (ML) decoding of short constraint length convolutional codes became
feasible with the invention of the Viterbi decoder. Several authors have since upper …

Viterbi (1971) introduced a structure generating function T (D, N, L) for convolutional codes
and used it to bound the probability of a decoding error P (̄ e). Viterbi's result is used to …

A Markovian technique is described to calculate the exact performance of the Viterbi
algorithm used as either a channel decoder or a source encoder for a convolutional code …

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 …

Considers trellis decoding of convolutional codes with selectable effort, as measured by
decoder complexity. Decoding is described for single parent codes with a variety of …

The paper is concerned with the relative performance of short constraint length
convolutional codes vis-a-vis block codes when used in conjunction with either BPSK or …

This paper reports the results of a computer analysis of the distance properties of some of
the best known rate 1/2, 1/3, and 1/4 codes to constraint length 14. The data include the …

New upper and lower bounds and approximations on the sequence, event, first event, and
bit-error probabilities of convolutional codes are presented. Each of these probabilities are …

Convolutional codes are characterized by a trellis structure. Maximum-likelihood decoding is
characterized as the finding of the shortest path through the code trellis, an efficient solution …