\(F[x]\)-lattice basis reduction algorithm and multisequence synthesis
From MaRDI portal
Publication:865955
DOI10.1007/BF02714735zbMath1125.94318MaRDI QIDQ865955
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
reduced basis; multisequence shift-register synthesis; \(F[x\)-lattice basis reduction algorithm]; normal reduced basis
68W30: Symbolic computation and algebraic computation
94A55: Shift register sequences and sequences over finite alphabets in information and communication theory
Related Items
On the joint linear complexity profile of explicit inversive multisequences, A lattice-based minimal partial realization algorithm for matrix sequences of varying length, Lattice basis reduction algorithms and multi-dimensional continued fractions, Enumeration results on the joint linear complexity of multisequences, Solving the FCSR synthesis problem for multi-sequences by lattice basis reduction, Successive minima profile, lattice profile, and joint linear complexity profile of pseudorandom multisequences, Fast lattice reduction for $\mathbf {F}_{2}$-linear pseudorandom number generators, A Lattice-Based Minimal Partial Realization Algorithm