Pages that link to "Item:Q3547781"

The following pages link to On the Lattice Basis Reduction Multisequence Synthesis Algorithm (Q3547781):

Displaying 15 items.

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