• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Counting Polynomial Matrices over Finite Fields

Counting Polynomial Matrices over Finite Fields

Paperback

Algebra

ISBN10: 3958260640
ISBN13: 9783958260641
Publisher: Lightning Source Inc
Published: Sep 15 2017
Pages: 164
Weight: 0.60
Height: 0.35 Width: 6.69 Depth: 9.61
Language: English
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.

Also in

Algebra