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

DOI10.1007/S12095-010-0037-8zbMATH Open1235.94043OpenAlexW2073452839MaRDI QIDQ662164FDOQ662164

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

Recommendations

• A Lattice-Based Minimal Partial Realization Algorithm
• Publication:4731310
• On minimality in the partial realization problem
• An algebraic method to solve the minimal partial realization problem for scalar sequences
• On multivariable partial realization†

zbMATH Keywords

linear complexityjoint linear complexityminimal partial realizationlinear feedback register synthesislinear system theory

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (5)

• A simple approach to matrix realizations for Littlewood-Richardson sequences
• Title not available (Why is that?)
• An algebraic method to solve the minimal partial realization problem for scalar sequences
• A Lattice-Based Minimal Partial Realization Algorithm
• 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)