Wiland Schmale

Time-varying polynomial matrix systems

Abstract Differential polynomial matrices with coefficients meromorphic on an open interval I⊆R are studied first. The subclass of full matrices P (having the properties P is non-singular antl every local solution of Pf =0 extends analytically to I) forms a sublattice with respect to right division of square matrices which is anti-isomorphic to the lattice of the corresponding solution spaces. This and further properties are then exploited in the study of time-varying systems in differential operator representation. Results on equivalence, state space models, controllability/observability and transfer functions are derived.

On Cyclic Convolutional Codes

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.

On Doubly-Cyclic Convolutional Codes: MSC (2000)

Cyclicity of a convolutional code (CC) is relying on a nontrivial automorphism of the algebra

Towards an Effective Version of a Theorem of Stafford

\mathbb{F}[x]/(x^n-1)

C[y] is a CA-ring and coefficient assignment is properly weaker than feedback cyclization over a PID

, where

(A,B)-cyclic submodules

\mathbb{F}