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 …

The author denotes by w/sub 0/the minimum average weight per edge over all nonzero
cycles in the state diagram for a convolutional code, and assumes that a technique is …

We look at convolutional codes with maximum possible code length for prescribed
redundancy, conditioned on constraints on the free distance and on the bit-oriented trellis …

We discuss algorithms for determining exactly the lower terms of the weight distribution of a
turbo code. Several improvements of the recently introduced algorithm by R. Garello et …

Consider a cycle in the state diagram of a convolutional code. The average weight per
branch of the cycle is equal to the total Hamming weight of all labels on the branches …

Convolutional codes with rate R=(n-1)/n, n/spl ges/2, are defined in terms of their minimal
parity check matrices. The matrices are represented by a binary vector notation introduced …

We introduce general sphere-packing bounds for convolutional codes. These improve upon
the Heller (1968) bound for high-rate convolutional codes. For example, based on the Heller …

We introduce general sphere packing bounds for convolutional codes. These improve upon
the Heller bound [JL Heller (1968)] for high rate convolutional codes. For example, based on …

This chapter of the Handbook of Coding Theory differs from the others in that it deals
exclusively with the class of convolutional, rather than block, codes. In some ways the two …

In this paper, we present a self-contained introduction to the algebraic theory of
convolutional codes, which is partly tutorial, but at the same time contains a number of new …