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 …

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 …

Punctured convolutional codes of rate<tex>(n-1)/n</tex>and simplified maximum likelihood
decoding (Corresp.) Page 1 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. IT-25 …

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 …

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 …

The construction and performance of cascaded convolutional codes is investigated. An
interleaver is used between the inner and outer codes to redistribute errors out of the inner …

Some long rate one-half binary convolutional codes with an optimum distance profile (Corresp.)
Page 1 CORRESPONDENCE 629 where 0 is the M-by-M cyclic permutation matrix (28) and …

This correspondence deals with the design and decoding of high-rate convolutional codes.
After proving that every (n, n-1) convolutional code can be reduced to a structure that …

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 …

A parallel concatenated convolutional coding scheme consists of two constituent systematic:
convolutional encoders linked by an interleaver. The information bits at the input of the first …