Counting Polynomial Matrices over Finite Fields

This book is dealing with three mathematical areas, namely polynomial matrices over finite fields, linear systems and coding theory. Primeness properties of polynomial matrices provide criteria for the reachability and observability of interconnected linear systems. Since time-discrete linear systems over finite fields and convolutional codes are basically the same objects, these results could be transferred to criteria for non-catastrophicity of convolutional codes. In particular, formulas for the number of pairwise coprime polynomials and for the number of mutually left coprime polynomial matrices are calculated. This leads to the probability that a parallel connected linear system is reachable and that a parallel connected convolutional code is non-catastrophic. Moreover, other networks of linear systems and convolutional codes are considered.