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

DOI10.1007/BF02714735zbMath1125.94318OpenAlexW1848470765MaRDI QIDQ865955

Yuefei Zhu, Li-Ping 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

reduced basismultisequence shift-register synthesis\(F[x\)-lattice basis reduction algorithm]normal reduced 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)

Related Items (8)

A lattice-based minimal partial realization algorithm for matrix sequences of varying length ⋮ Solving the FCSR synthesis problem for multi-sequences by lattice basis reduction ⋮ Lattice basis reduction algorithms and multi-dimensional continued fractions ⋮ Successive minima profile, lattice profile, and joint linear complexity profile of pseudorandom multisequences ⋮ On the joint linear complexity profile of explicit inversive multisequences ⋮ A Lattice-Based Minimal Partial Realization Algorithm ⋮ Enumeration results on the joint linear complexity of multisequences ⋮ Fast lattice reduction for $\mathbf {F}_{2}$-linear pseudorandom number generators

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