Reachability of random linear systems over finite fields

DOI10.1007/978-3-319-17296-5_23MaRDI QIDQ3460468zbMATH OpenOpenAlexFDO

Authors Jens Jordan, Julia Lieb, Uwe 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

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

Recommendations

• Probability estimates for reachability of linear systems defined over finite fields
• The probability of primeness for specially structured polynomial matrices over finite fields with applications to linear systems and convolutional codes
• On the number of controllable linear systems over a finite field
• A Survey of Determinacy of Infinite Games in Second Order Arithmetic
• On stable systems with random structure

Cites work

• scientific article; zbMATH DE number 481629 (Why is no real title available?)
• BCH convolutional codes
• Characteristic Classes. (AM-76)
• Convolutional codes with maximum distance profile
• Linear network coding
• On the number of controllable linear systems over a finite field
• Relatively prime polynomials and nonsingular Hankel matrices over finite fields
• Structural Controllability and Observability of Linear Systems Over Finite Fields With Applications to Multi-Agent Systems
• The mathematics of networks of linear systems
• Topology of the moduli space for reachable linear dynamical systems: The complex case

Cited in

(5)

• Probability estimates for reachability of linear systems defined over finite fields
• Counting zero kernel pairs over a finite field
• On the number of controllable linear systems over a finite field
• 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

This page was built for publication: Reachability of random linear systems over finite fields

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3460468)