F[x]-lattice basis reduction algorithm and multisequence synthesis

DOI10.1007/BF02714735MaRDI QIDQ865955zbMATH OpenOpenAlexFDO

Authors Yue-Fei Zhu, L.-P. Wang

Publication date 20 February 2007

Published in Science in China. Series F (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02714735

zbMATH Keywords

\(F[x\)-lattice basis reduction algorithm]multisequence shift-register synthesisnormal reduced basisreduced basis

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)

Recommendations

• scientific article; zbMATH DE number 1852144
• On minimal polynomials over \(\mathbb F_{q^m}\) and over \(\mathbb F_q\) of a finite-length sequence over \(\mathbb F_{q^m}\)
• A linear algebraic approach to multisequence shift-register synthesis
• On lattice-based algebraic feedback shift registers synthesis for multisequences
• On the Lattice Basis Reduction Multisequence Synthesis Algorithm

Cited in

(16)

• On lattice-based algebraic feedback shift registers synthesis for multisequences
• Solving the FCSR synthesis problem for multi-sequences by lattice basis reduction
• A generalization of Gröbner bases and a synthesis algorithm of multisequence over \(\mathbb{Z}/(m)\)
• Successive minima profile, lattice profile, and joint linear complexity profile of pseudorandom multisequences
• Fast lattice reduction for F₂-linear pseudorandom number generators
• On the Lattice Basis Reduction Multisequence Synthesis Algorithm
• A Lattice-Based Minimal Partial Realization Algorithm
• scientific article; zbMATH DE number 1852144 (Why is no real title available?)
• On minimal polynomials over \(\mathbb F_{q^m}\) and over \(\mathbb F_q\) of a finite-length sequence over \(\mathbb F_{q^m}\)
• On the joint linear complexity profile of explicit inversive multisequences
• Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
• Fast multi-sequence shift-register synthesis with the Euclidean algorithm
• A lattice-based minimal partial realization algorithm for matrix sequences of varying length
• A linear algebraic approach to multisequence shift-register synthesis
• Lattice basis reduction algorithms and multi-dimensional continued fractions
• Enumeration results on the joint linear complexity of multisequences

This page was built for publication: \(F[x]\)-lattice basis reduction algorithm and multisequence synthesis

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