57,59 €
63,99 €
-10% with code: EXTRA
Counting Polynomial Matrices over Finite Fields
Counting Polynomial Matrices over Finite Fields
57,59
63,99 €
  • We will send in 10–14 business days.
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…
63.99
  • SAVE -10% with code: EXTRA

Counting Polynomial Matrices over Finite Fields (e-book) (used book) | bookbook.eu

Reviews

Description

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.

EXTRA 10 % discount with code: EXTRA

57,59
63,99 €
We will send in 10–14 business days.

The promotion ends in 23d.14:23:40

The discount code is valid when purchasing from 10 €. Discounts do not stack.

Log in and for this item
you will receive 0,64 Book Euros!?

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.

Reviews

  • No reviews
0 customers have rated this item.
5
0%
4
0%
3
0%
2
0%
1
0%
(will not be displayed)