On the Lattice Basis Reduction Multisequence Synthesis Algorithm

DOI10.1109/TIT.2004.836670MaRDI QIDQ3547781zbMATH OpenOpenAlexFDO

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

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

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

Recommendations

• \(F[x]\)-lattice basis reduction algorithm and multisequence synthesis
• A linear algebraic approach to multisequence shift-register synthesis
• On lattice-based algebraic feedback shift registers synthesis for multisequences
• Solving the FCSR synthesis problem for multi-sequences by lattice basis reduction
• Lattice basis reduction algorithms and multi-dimensional continued fractions

Cited in

(18)

• Periodic multisequences with large error linear complexity
• On lattice-based algebraic feedback shift registers synthesis for multisequences
• Fast skew-feedback shift-register synthesis
• Successive minima profile, lattice profile, and joint linear complexity profile of pseudorandom multisequences
• Determining the k-error joint linear complexity spectrum for a binary multisequence with period p^n
• Fast lattice reduction for F₂-linear pseudorandom number generators
• A Lattice-Based Minimal Partial Realization Algorithm
• scientific article; zbMATH DE number 4072864 (Why is no real title available?)
• 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}\)
• 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
• A linear algebraic approach to multisequence shift-register synthesis
• \(F[x]\)-lattice basis reduction algorithm and multisequence synthesis
• The asymptotic behavior of the joint linear complexity profile of multisequences
• Error linear complexity measures for multisequences
• Lattice basis reduction algorithms and multi-dimensional continued fractions
• Enumeration results on the joint linear complexity of multisequences

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

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