Probability estimates for reachability of linear systems defined over finite fields
DOI10.3934/AMC.2016.10.63zbMATH Open1332.93053OpenAlexW2323900454MaRDI QIDQ259269FDOQ259269
Authors: Jens Jordan, Julia Lieb, Uwe Helmke 
Publication date: 11 March 2016
Published in: Advances in Mathematics of Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/amc.2016.10.63
Recommendations
- Reachability of random linear systems over finite fields
- Probabilistic properties of systems of random linear equations over finite algebraic structures
- scientific article; zbMATH DE number 3919427
- The Probability of Consistency of a System of Random Linear Equations over an Arbitrary Finite Ring
- ESTIMATES OF REACHABLE SETS FOR LINEAR SYSTEMS
- Characteristics of random systems of linear equations over a finite field
- scientific article; zbMATH DE number 1245633
- scientific article; zbMATH DE number 1884411
- A threshold effect for systems of random equations in finite fields
- Probabilistic complexity analysis for linear problems in bounded domains
Controllability (93B05) Polynomials over finite fields (11T06) Linear systems in control theory (93C05) Discrete-time control/observation systems (93C55) Algebraic methods (93B25)
Cites Work
- On the number of controllable linear systems over a finite field
- The mathematics of networks of linear systems
- Relatively prime polynomials and nonsingular Hankel matrices over finite fields
- Reverse-engineering of polynomial dynamical systems
- Topology of the moduli space for reachable linear dynamical systems: The complex case
- On behaviors and convolutional codes
- Counting tuples restricted by pairwise coprimality conditions
- Network Coding
- Characteristic Classes. (AM-76)
- Title not available (Why is that?)
- BCH convolutional codes
- Woven convolutional codes .I. Encoder properties
- Structural Controllability and Observability of Linear Systems Over Finite Fields With Applications to Multi-Agent Systems
- A first approximation of concatenated convolutional codes from linear systems theory viewpoint
Cited In (8)
- On the number of controllable linear systems over a finite field
- Polynomial matrices, splitting subspaces and Krylov subspaces over finite fields
- Enumerating partial linear transformations in a similarity class
- Reachability of random linear systems over finite fields
- Tuples of polynomials over finite fields with pairwise coprimality conditions
- The probability of primeness for specially structured polynomial matrices over finite fields with applications to linear systems and convolutional codes
- Unimodular polynomial matrices over finite fields
- Uniform probability and natural density of mutually left coprime polynomial matrices over finite fields
This page was built for publication: Probability estimates for reachability of linear systems defined over finite fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q259269)
