New upper bounds on the linear complexity
From MaRDI portal
Recommendations
- Regular cosets and upper bounds on the linear complexity of certain sequences
- Improved Bounds on the Linear Complexity of Keystreams Obtained by Filter Generators
- On the linear complexity of nonlinearly filtered PN-sequences
- scientific article; zbMATH DE number 825180
- On the linear complexity parameter and second order nonlinear filters.
Cites work
- An analysis of the structure and complexity of nonlinear binary sequence generators
- Linear Complexity and Random Sequences
- Lower bounds for the linear complexity of sequences over residue rings
- On Certain Nonlinear Recurring Sequences
- On the linear complexity of nonlinearly filtered PN-sequences
- Shift-register synthesis and BCH decoding
- The linear complexity profile and the jump complexity of keystream sequences
- The stability theory of stream ciphers
Cited in
(7)- Analysis of the upper bound on the complexity of LLL algorithm
- Regular cosets and upper bounds on the linear complexity of certain sequences
- An upper bound for the linearity of exponential Welch-Costas functions
- scientific article; zbMATH DE number 825180 (Why is no real title available?)
- New results on the mathematical foundations of asymptotic complexity analysis of algorithms via complexity spaces
- New Bounds on the Capacity of Multidimensional Run-Length Constraints
- scientific article; zbMATH DE number 7650076 (Why is no real title available?)
This page was built for publication: New upper bounds on the linear complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1570119)