The following pages link to (Q3653404):
Displaying 4 items.
- Distribution of one-error linear complexity of binary sequences for arbitrary prime period (Q394411) (← links)
- How many bits have to be changed to decrease the linear complexity? (Q702172) (← links)
- On \(k\)-error linear complexity of pseudorandom binary sequences derived from Euler quotients (Q1620976) (← links)
- On the \(k\)-error linear complexity of sequences with period \(2p^{n}\) over \(GF(q)\) (Q2430407) (← links)