Pages that link to "Item:Q1394937"
From MaRDI portal
The following pages link to The expected value of the joint linear complexity of periodic multisequences (Q1394937):
Displaying 13 items.
- The minimal polynomial of a sequence obtained from the componentwise linear transformation of a linear recurring sequence (Q410701) (← links)
- Multisequences with large linear and \(k\)-error linear complexity from a tower of Artin-Schreier extensions of function fields (Q439096) (← links)
- On the joint linear complexity profile of explicit inversive multisequences (Q558009) (← links)
- Improved results on periodic multisequences with large error linear complexity (Q609363) (← links)
- Joint linear complexity of arbitrary multisequences consisting of linear recurring sequences (Q841240) (← links)
- The asymptotic behavior of the joint linear complexity profile of multisequences (Q877184) (← links)
- Error linear complexity measures for multisequences (Q883329) (← links)
- Reducing the calculation of the linear complexity of \(u_2^v\)-periodic binary sequences to Games-Chan algorithm (Q1008964) (← links)
- Periodic multisequences with large error linear complexity (Q1009057) (← 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)
- How to determine linear complexity and \(k\)-error linear complexity in some classes of linear recurring sequences (Q1032492) (← links)
- The minimal polynomial over \(\mathbb F_q\) of linear recurring sequence over \(\mathbb F_{q^m}\) (Q1046471) (← links)
