A Lattice-Based Minimal Partial Realization Algorithm

DOI10.1007/978-3-540-85912-3_25zbMath1206.94046OpenAlexW1553451769MaRDI QIDQ3600448

Li-Ping Wang

Publication date: 10 February 2009

Published in: Sequences and Their Applications - SETA 2008 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-85912-3_25

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)

Related Items (1)

On minimal polynomials over \(\mathbb F_{q^m}\) and over \(\mathbb F_q\) of a finite-length sequence over \(\mathbb F_{q^m}\)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• Minimal Bases of Rational Vector Spaces, with Applications to Multivariable Linear Systems
• 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
• Shift-register synthesis and BCH decoding

This page was built for publication: A Lattice-Based Minimal Partial Realization Algorithm