Pages that link to "Item:Q438884"
From MaRDI portal
The following pages link to A counterexample concerning the 3-error linear complexity of \(2^{n }\)-periodic binary sequences (Q438884):
Displaying 5 items.
- Correction to: ``On the linear complexity of the Sidelnikov-Lempel-Cohn-Eastman sequences'' (Q2324773) (← links)
- The \(k\)-error linear complexity distribution for \(2^n\)-periodic binary sequences (Q2510654) (← links)
- On the \(k\)-error linear complexity for \(p^n\)-periodic binary sequences via hypercube theory (Q2668568) (← links)
- Regularity versus complexity in the binary representation of 3^n (Q5188210) (← links)
- (Q5398496) (← links)
