menu
{ "item_title" : "Counting Polynomial Matrices over Finite Fields", "item_author" : [" Julia Lieb "], "item_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.", "item_img_path" : "https://covers2.booksamillion.com/covers/bam/3/95/826/064/3958260640_b.jpg", "price_data" : { "retail_price" : "35.50", "online_price" : "35.50", "our_price" : "35.50", "club_price" : "35.50", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : "" } }
Counting Polynomial Matrices over Finite Fields|Julia Lieb

Counting Polynomial Matrices over Finite Fields

local_shippingShip to Me
In Stock.
FREE Shipping for Club Members help

Overview

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.

This item is Non-Returnable

Details

  • ISBN-13: 9783958260641
  • ISBN-10: 3958260640
  • Publisher: Wurzburg University Press
  • Publish Date: September 2017
  • Dimensions: 9.61 x 6.69 x 0.35 inches
  • Shipping Weight: 0.6 pounds
  • Page Count: 164

Related Categories

You May Also Like...

    1

BAM Customer Reviews