Pages that link to "Item:Q2860219"
From MaRDI portal
The following pages link to A fast algorithm for the 2-adic joint complexity of \(p^n\)-periodic binary multisequence (Q2860219):
Displaying 3 items.
- Determining the \(k\)-error joint linear complexity spectrum for a binary multisequence with period \(p^n\) (Q301631) (← links)
- FCSR periodic multisequences with maximal joint \(N\)-adic complexity and large \(k\)-error joint \(N\)-adic complexity over \(\mathbb Z/(N)\) (Q488927) (← links)
- On the joint 2-adic complexity of binary multisequences (Q2905327) (← links)
