Pages that link to "Item:Q702172"
From MaRDI portal
The following pages link to How many bits have to be changed to decrease the linear complexity? (Q702172):
Displaying 15 items.
- Determining the \(k\)-error joint linear complexity spectrum for a binary multisequence with period \(p^n\) (Q301631) (← links)
- On the \(k\)-error linear complexity of \(\ell\)-sequences (Q609360) (← links)
- An algorithm for computing the error sequence of \(p^{n}\)-periodic binary sequences (Q742512) (← links)
- Joint linear complexity of multisequences consisting of linear recurring sequences (Q1032485) (← links)
- Lower bounds on error complexity measures for periodic LFSR and FCSR sequences (Q1032491) (← links)
- On the linear complexity of binary threshold sequences derived from Fermat quotients (Q1949234) (← links)
- Complete characterization of the first descent point distribution for the \(k\)-error linear complexity of \(2^n\)-periodic binary sequences (Q2408276) (← links)
- Structure analysis on the \(k\)-error linear complexity for \(2^n\)-periodic binary sequences (Q2411159) (← links)
- On the \(k\)-error linear complexity of sequences with period \(2p^{n}\) over \(GF(q)\) (Q2430407) (← links)
- On the error linear complexity spectrum of \(p^n\)-periodic binary sequences (Q2441445) (← links)
- On the \(k\)-error linear complexity for \(p^n\)-periodic binary sequences via hypercube theory (Q2668568) (← links)
- Additive character sums of polynomial quotients (Q2869127) (← links)
- How Much Can Complexity of Linear Cryptanalysis Be Reduced? (Q2942831) (← links)
- Thek-error linear complexity and the linear complexity forpq n-periodic binary sequences (Q3443217) (← links)
- On the k-error linear complexity of binary sequences derived from polynomial quotients (Q5046474) (← links)
