Pages that link to "Item:Q2905327"
From MaRDI portal
The following pages link to On the joint 2-adic complexity of binary multisequences (Q2905327):
Displaying 4 items.
- FCSR periodic multisequences with maximal joint \(N\)-adic complexity and large \(k\)-error joint \(N\)-adic complexity over \(\mathbb Z/(N)\) (Q488927) (← 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 fast algorithm for the 2-adic joint complexity of \(p^n\)-periodic binary multisequence (Q2860219) (← links)