2000 character limit reached
The Probability of Primeness for Specially Structured Polynomial Matrices over Finite Fields with Applications to Linear Systems and Convolutional Codes
Published 8 Sep 2016 in math.DS, cs.IT, math.IT, and math.OC | (1609.02310v2)
Abstract: We calculate the probability that random polynomial matrices over a finite field with certain structures are right prime or left prime, respectively. In particular, we give an asymptotic formula for the probability that finitely many nonsingular polynomial matrices are mutually left coprime. These results are used to estimate the number of reachable and observable linear systems as well as the number of non-catastrophic convolutional codes. Moreover, we are able to achieve an asymptotic formula for the probability that a parallel connected linear system is reachable.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.