Paper detail

Skew Laurent Series and General Cyclic Convolutional Codes

Convolutional codes were originally conceived as vector subspaces of a finite-dimensional vector space over a field of Laurent series having a polynomial basis. Piret and Roos modeled cyclic structures on them by adding a module structure over a finite-dimensional algebra skewed by an algebra automorphism. These cyclic convolutional codes turn out to be equivalent to some right ideals of a skew polynomial ring built from the automorphism. When a skew derivation is considered, serious difficulties arise in defining such a skewed module structure on Laurent series. We discuss some solutions to this problem which involve a purely algebraic treatment of the left skew Laurent series built from a left skew derivation of a general coefficient ring, when possible.