Linear feedback shift registers and the minimal realization problem
From MaRDI portal
Publication:2002558
DOI10.1016/j.laa.2018.06.009zbMath1418.93095OpenAlexW2808184254MaRDI QIDQ2002558
Publication date: 12 July 2019
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10251/139843
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the geometry of realizable Markov parameters by SIMO and MISO systems
- Extension of the Berlekamp-Massey algorithm to N dimensions
- On parametrizations for the minimal partial realization problem
- On the partial realization problem
- Finding a minimal set of linear recurring relations capable of generating a given finite two-dimensional array
- A generalization of the Massey-Ding algorithm
- An algorithm for constructing a minimal partial realization in the multivariable case
- A simple Hankel interpretation of the Berlekamp-Massey algorithm
- Finite linear recurring sequences and homogeneous ideals
- On the matrix berlekamp-massey algorithm
- A generalization of the Berlekamp-Massey algorithm for multisequence shift-register synthesis with applications to decoding cyclic codes
- On recursiveness and related topics in linear systems
- A minimal realization algorithm for matrix sequences
- Shift-register synthesis and BCH decoding
- Recursive Identification of Linear Systems