Pages that link to "Item:Q5400126"

The following pages link to Some algorithms for the error linear complexity of binary 2 n -periodic sequences (Q5400126):

Displaying 9 items.

• Reducing the calculation of the linear complexity of \(u_2^v\)-periodic binary sequences to Games-Chan algorithm (Q1008964) (← links)
• Lower bounds on error complexity measures for periodic LFSR and FCSR sequences (Q1032491) (← links)
• The distribution of \(2^n\)-periodic binary sequences with fixed \(k\)-error linear complexity (Q1631841) (← links)
• Binary sequences with period \(N\) and nonlinear complexity \(N - 2\) (Q2311428) (← links)
• Counting Functions for the k-Error Linear Complexity of 2 n -Periodic Binary Sequences (Q3644198) (← links)
• Efficient NLMS and RLS Algorithms for Perfect and Imperfect Periodic Sequences (Q4570168) (← links)
• (Q4857241) (← links)
• (Q5398496) (← links)
• On the Computation of the Linear Complexity and the k-Error Linear Complexity of Binary Sequences with Period a Power of Two (Q5450824) (← links)