Algebraically, a convolutional code is a submodule of
the free F[z]-module F[z]^n
of polynomial vectors over a finite field F.
We will discuss different representations of convolutional
codes along with the relevant parameters.
It will be shown how the encoding process can be realized by linear shift
registers which then will explain the relevance of minimal encoders.
In this context the complexity and the uniqueness of the Forney-indices
will
be discussed.
Thereafter, the notion of column distances will be introduced and it will
be
shown how (in principle) the distance of a convolutional code can be computed.
Finally, we will briefly address the decoding procedures for convolutional
codes
used in practice.
Back to upcoming
events page