A lattice-based minimal partial realization algorithm for matrix sequences of varying length

DOI10.1007/S12095-010-0037-8MaRDI QIDQ662164zbMATH OpenOpenAlexFDO

Authors L.-P. Wang

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

zbMATH Keywords

joint linear complexitylinear complexitylinear feedback register synthesislinear system theoryminimal partial realization

Mathematics Subject Classification ID

Realizations from input-output data (93B15) Synthesis problems (93B50) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60) Decoding (94B35)

Recommendations

• A Lattice-Based Minimal Partial Realization Algorithm
• scientific article; zbMATH DE number 4116730
• On minimality in the partial realization problem
• An algebraic method to solve the minimal partial realization problem for scalar sequences
• On multivariable partial realization†

Cites work

• \(F[x]\)-lattice basis reduction algorithm and multisequence synthesis
• A generalization of the Berlekamp-Massey algorithm for multisequence shift-register synthesis with applications to decoding cyclic codes
• A generalized minimal partial realization problem
• A minimal realization algorithm for matrix sequences
• An algorithm for constructing a minimal partial realization in the multivariable case
• Construction and estimation of bases in function fields
• Factoring multivariate polynomials over finite fields
• scientific article; zbMATH DE number 1583787 (Why is no real title available?)
• scientific article; zbMATH DE number 653111 (Why is no real title available?)
• scientific article; zbMATH DE number 1996484 (Why is no real title available?)
• On recursiveness and related topics in linear systems
• On the Lattice Basis Reduction Multisequence Synthesis Algorithm
• On the partial realization problem
• Rational approximation in linear systems and control
• Shift-register synthesis and BCH decoding
• Syndrome Decoding of Reed–Solomon Codes Beyond Half the Minimum Distance Based on Shift-Register Synthesis

Cited in

(5)

• An algebraic method to solve the minimal partial realization problem for scalar sequences
• A simple approach to matrix realizations for Littlewood-Richardson sequences
• A Lattice-Based Minimal Partial Realization Algorithm
• scientific article; zbMATH DE number 4116730 (Why is no real title available?)
• On minimality in the partial realization problem

This page was built for publication: A lattice-based minimal partial realization algorithm for matrix sequences of varying length

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