Pages that link to "Item:Q883329"
From MaRDI portal
The following pages link to Error linear complexity measures for multisequences (Q883329):
Displaying 12 items.
- Determining the \(k\)-error joint linear complexity spectrum for a binary multisequence with period \(p^n\) (Q301631) (← links)
- 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)
- Improved results on periodic multisequences with large error linear complexity (Q609363) (← 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)
- The minimal polynomial over \(\mathbb F_q\) of linear recurring sequence over \(\mathbb F_{q^m}\) (Q1046471) (← links)
- On the linear complexity for multidimensional sequences (Q1791680) (← links)
- The expectation and variance of the joint linear complexity of random periodic multisequences (Q2577529) (← links)
- On the joint 2-adic complexity of binary multisequences (Q2905327) (← links)
- An algorithm for<i>k</i>-error joint linear complexity of binary multisequences (Q3542554) (← links)
