Reachability of Random Linear Systems over Finite Fields

DOI10.1007/978-3-319-17296-5_23zbMath1327.93066OpenAlexW2358955226MaRDI QIDQ3460468

Julia Lieb, Jens Jordan, Uwe R. Helmke

Publication date: 7 January 2016

Published in: Coding Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-17296-5_23

zbMATH Keywords

linear systemsreachabilityfinite fieldsGrassmann manifoldsparallel connection

Mathematics Subject Classification ID

Discrete-time control/observation systems (93C55) Linear systems in control theory (93C05) Observability (93B07) Stochastic systems in control theory (general) (93E03) Attainable sets, reachability (93B03)

Related Items (3)

The probability of primeness for specially structured polynomial matrices over finite fields with applications to linear systems and convolutional codes ⋮ The number of linear transformations defined on a subspace with given invariant factors ⋮ Counting zero kernel pairs over a finite field

Cites Work

• Unnamed Item
• 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
• Convolutional codes with maximum distance profile
• Topology of the moduli space for reachable linear dynamical systems: The complex case
• Characteristic Classes. (AM-76)
• BCH convolutional codes
• Linear network coding
• Structural Controllability and Observability of Linear Systems Over Finite Fields With Applications to Multi-Agent Systems

This page was built for publication: Reachability of Random Linear Systems over Finite Fields