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 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 …

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 …

An upper bound on the error probability (first error event) of product convolutional codes
over a memoryless binary symmetric channel, and the resulting error exponent are derived …

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 …

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 …

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 …

A new proof is presented for the existence of block codes whose error probability under
maximum likelihood decoding is bounded asymptotically by the random coding bound …

In this correspondence, the low-weight terms of the weight distribution of the block code
obtained by terminating a convolutional code after x information blocks are expressed as a …

A family of active distance measures for general convolutional codes is defined. These
distances are generalizations of the extended distances introduced by Thommesen and …