The predictable degree property and row reducedness for systems over a finite ring

A.T. Antoulas (Editor), Margreta Kuijper, U. Helmke (Editor), Raquel Pinto, J. Rosenthal (Editor), Jan W. Polderman, V. Vinnikov (Editor), E. Zerz (Editor)

    Research output: Contribution to journalArticleAcademicpeer-review

    21 Citations (Scopus)
    1 Downloads (Pure)


    Motivated by applications in communications, we consider linear discrete time systems over the finite ring $Z_{p^r}$. We solve the open problem of deriving a theory of row reduced representations for these systems. We introduce a less restrictive form of representation than the adapted form introduced by Fagnani and Zampieri. We call this form the ``composed form''. We define the concept of ``$p$-predictable degree property'' and ``$p$-row reduced''. We demonstrate that these concepts, coupled with the composed form, provide a natural setting that extends several classical results from the field case to the ring case. In particular, the classical rank test on the leading row coefficient matrix is generalized. We show that any annihilator of a behavior $\mathfrak{B}$ of a pre-specified degree is uniquely parametrized with finitely many coefficients in terms of a kernel representation in $p$-row-reduced composed form. The underlying theory is the theory of ``reduced $p$-basis'' for submodules of $Z^q_{p^r}[\xi]$ that is developed in this paper. We show how to construct a $p$-row reduced kernel representation in composed form by constructing a reduced $p$-basis for the module $\mathfrak{B}^{\perp}$.
    Original languageUndefined
    Article number10.1016/j.laa.2007.04.015
    Pages (from-to)776-796
    Number of pages21
    JournalLinear algebra and its applications
    Issue numberLNCS4549/2-3
    Publication statusPublished - 1 Sept 2007


    • Linear systems
    • polynomial matrices
    • finite rings
    • kernel representations
    • Behaviors
    • row reduced
    • EWI-10862
    • METIS-241836
    • IR-61881
    • predictable degree property

    Cite this