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 …

The weight spectra of high-rate lpunctured convolutional codes are evaluated under the
hypothesis of a low-rate structure. This interpretation yields results slightly different from …

A search procedure is developed to find good short binary (N, N-1) convolutional codes. It
uses simple rules to discard from the complete ensemble of codes a large fraction whose …

Two procedures for decoding linear systematic codes, majority decoding and a posteriori
probability decoding, are formulated. The essential feature of both methods is a linear …

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 …

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 …

An investigation is conducted of the high-rate punctured convolutional codes suitable for
Viterbi and sequential decoding. Results on known short-memory codes M less than or …

This paper gives a tabulation of binary convolutional codes with maximum free distance for
rates 1 2, 1 3, and 1 4 for all constraint lengths (measured in information digits) ν up to and …

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 …

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 …