Pages that link to "Item:Q742512"
From MaRDI portal
The following pages link to An algorithm for computing the error sequence of \(p^{n}\)-periodic binary sequences (Q742512):
Displaying 4 items.
- 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)
- \(m\)-tight error linear complexity of binary sequences with period \(2p^n\) (Q2916331) (← links)
- Efficient NLMS and RLS Algorithms for Perfect and Imperfect Periodic Sequences (Q4570168) (← links)
