On Cyclic Convolutional Codes
Source: Acta Applicandae Mathematicae, Volume 82, Number 2, June 2004 , pp. 183-237(55)
Abstract:We investigate the notion of cyclicity for convolutional codes as it has been introduced by Piret and Roos. Codes of this type are described as submodules of F[z] n with some additional generalized cyclic structure but also as specific left ideals in a skew polynomial ring. Extending a result of Piret, we show in a purely algebraic setting that these ideals are always principal. This leads to the notion of a generator polynomial just like for cyclic block codes. Similarly a parity check polynomial can be introduced by considering the right annihilator ideal. An algorithmic procedure is developed which produces unique reduced generator and parity check polynomials. We also show how basic code properties and a minimal generator matrix can be read off from these objects. A close link between polynomial and vector description of the codes is provided by certain generalized circulant matrices.
Document Type: Research Article
Publication date: June 1, 2004