A lattice-based minimal partial realization algorithm for matrix sequences of varying length
From MaRDI portal
Publication:662164
DOI10.1007/s12095-010-0037-8zbMath1235.94043OpenAlexW2073452839MaRDI QIDQ662164
Publication date: 21 February 2012
Published in: Cryptography and Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12095-010-0037-8
linear complexityjoint linear complexityminimal partial realizationlinear feedback register synthesislinear system theory
Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60) Synthesis problems (93B50) Realizations from input-output data (93B15) Decoding (94B35)
Cites Work
- A generalized minimal partial realization problem
- \(F[x\)-lattice basis reduction algorithm and multisequence synthesis]
- On the partial realization problem
- Factoring multivariate polynomials over finite fields
- Construction and estimation of bases in function fields
- An algorithm for constructing a minimal partial realization in the multivariable case
- Rational approximation in linear systems and control
- A generalization of the Berlekamp-Massey algorithm for multisequence shift-register synthesis with applications to decoding cyclic codes
- On the Lattice Basis Reduction Multisequence Synthesis Algorithm
- On recursiveness and related topics in linear systems
- A minimal realization algorithm for matrix sequences
- Syndrome Decoding of Reed–Solomon Codes Beyond Half the Minimum Distance Based on Shift-Register Synthesis
- Shift-register synthesis and BCH decoding
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A lattice-based minimal partial realization algorithm for matrix sequences of varying length
