On the Lattice Basis Reduction Multisequence Synthesis Algorithm

DOI10.1109/TIT.2004.836670zbMath1178.94181OpenAlexW2166023498MaRDI QIDQ3547781

Li-Ping Wang, Yuefei Zhu, Pei Dingyi

Publication date: 21 December 2008

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.2004.836670

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Number-theoretic algorithms; complexity (11Y16)

Related Items (15)

Determining the \(k\)-error joint linear complexity spectrum for a binary multisequence with period \(p^n\) ⋮ The asymptotic behavior of the joint linear complexity profile of multisequences ⋮ Error linear complexity measures for multisequences ⋮ On lattice-based algebraic feedback shift registers synthesis for multisequences ⋮ Fast skew-feedback shift-register synthesis ⋮ An efficient lattice reduction method for \(\mathbf F_2\)-linear pseudorandom number generators using Mulders and Storjohann algorithm ⋮ A lattice-based minimal partial realization algorithm for matrix sequences of varying length ⋮ Lattice basis reduction algorithms and multi-dimensional continued fractions ⋮ Successive minima profile, lattice profile, and joint linear complexity profile of pseudorandom multisequences ⋮ On minimal polynomials over \(\mathbb F_{q^m}\) and over \(\mathbb F_q\) of a finite-length sequence over \(\mathbb F_{q^m}\) ⋮ A Lattice-Based Minimal Partial Realization Algorithm ⋮ Enumeration results on the joint linear complexity of multisequences ⋮ Periodic multisequences with large error linear complexity ⋮ Fast lattice reduction for $\mathbf {F}_{2}$-linear pseudorandom number generators ⋮ A linear algebraic approach to multisequence shift-register synthesis

This page was built for publication: On the Lattice Basis Reduction Multisequence Synthesis Algorithm