An explanation is given for the paradoxical fact that, at low signal-to-noise ratios, the
systematic feedback encoder results in fewer decoding bit errors than does a nonsystematic …

Analytic expressions for the bit error probabilities of the (7, 5) convolutional code as
functions of the crossover probability of the binary symmetric channel (BSC) are derived for …

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 …

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 …

The study the distance relations between the input sequences and the code sequences in
convolutional codes. Namely, starting from some encoder realization of a code, we …

A maximum a posteriori decoder is given for convolutional codes when transmitted over a
binary random error channel that exhibits insertion, deletion and substitution errors. It is …

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 …

In this paper, the decoder of a convolutional code is modeled as an autonomous stochastic
sequential machine and finite Markov chain theory applied to obtain a precise expression for …

Consider nonbacktracking convolutional decoders that keep a fixed number of trellis
survivors. It is shown that the error performance of these depends on the early part of the …