Pages that link to "Item:Q865955"
From MaRDI portal
The following pages link to \(F[x]\)-lattice basis reduction algorithm and multisequence synthesis (Q865955):
Displaying 13 items.
- 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)
- On the joint linear complexity profile of explicit inversive multisequences (Q558009) (← links)
- Fast multi-sequence shift-register synthesis with the Euclidean algorithm (Q660086) (← 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)
- Lattice basis reduction algorithms and multi-dimensional continued fractions (Q958608) (← links)
- Enumeration results on the joint linear complexity of multisequences (Q998652) (← links)
- On lattice-based algebraic feedback shift registers synthesis for multisequences (Q1699261) (← links)
- Solving the FCSR synthesis problem for multi-sequences by lattice basis reduction (Q1744015) (← links)
- A generalization of Gröbner bases and a synthesis algorithm of multisequence over \(\mathbb{Z}/(m)\) (Q1895453) (← 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)
