Products of linear recurring sequences with maximum complexity
From MaRDI portal
Recommendations
- On the linear complexity of product sequences of linear recurring sequences
- On the linear complexity of functions of periodic GF(q) sequences
- A remark on the minimal polynomial of the product of linear recurring sequences
- On the Linear Complexity of Combined Shift Register Sequences
- scientific article; zbMATH DE number 39524
Cited in
(16)- scientific article; zbMATH DE number 691469 (Why is no real title available?)
- Boolean functions: degree and support
- A remark on the minimal polynomial of the product of linear recurring sequences
- scientific article; zbMATH DE number 1394288 (Why is no real title available?)
- The conjecture of V. I. Nechaev on the product of linear recurrences
- scientific article; zbMATH DE number 1594284 (Why is no real title available?)
- A complexity measure for families of binary sequences
- Linear recurring sequences over rings and modules
- On the linear complexity of functions of periodic GF(q) sequences
- Factorization of determinants over finite fields and application in stream ciphers
- On the linear complexity of product sequences of linear recurring sequences
- Constructing digitized chaotic time series with a guaranteed enhanced period
- Productly linearly independent sequences
- On the minimal polynomial of the product of linear recurring sequences
- Generalization of Siegenthaler inequality and Schnorr-Vaudenay multipermutations
- Analysis of \((k_ 0,k_ 1)\) clock-controlled sequences
This page was built for publication: Products of linear recurring sequences with maximum complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3028877)
