On constructing a shortest linear recurrence relation
From MaRDI portal
Publication:4373060
DOI10.1109/9.649704zbMath0890.93019OpenAlexW2563919123MaRDI QIDQ4373060
Jan C. Willems, Margreet Kuijper
Publication date: 21 January 1998
Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/9.649704
coding theoryBerlekamp-Massey algorithmpartial realization problembehavioral approach of linear systems theory
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (3)
An algorithm for constructing a minimal partial realization in the multivariable case ⋮ An iterative algorithm for parametrization of shortest length linear shift registers over finite chain rings ⋮ Recursive exact \(H_{\infty }\)-identification from impulse-response measurements
This page was built for publication: On constructing a shortest linear recurrence relation
