Regular cosets and upper bounds on the linear complexity of certain sequences
From MaRDI portal
Recommendations
- New upper bounds on the linear complexity
- On the linear complexity of the sequences generated by nonlinear filterings
- Improved Bounds on the Linear Complexity of Keystreams Obtained by Filter Generators
- On the linear complexity parameter and second order nonlinear filters.
- On the linear complexity of nonlinearly filtered pn-sequences
Cited in
(8)- Factorization of determinants over finite fields and application in stream ciphers
- New upper bounds on the linear complexity
- On the linear complexity of multisequences, bijections between Zahlen and Number tuples, and partitions
- On the linear complexity of the sequences generated by nonlinear filterings
- Improved Bounds on the Linear Complexity of Keystreams Obtained by Filter Generators
- scientific article; zbMATH DE number 825180 (Why is no real title available?)
- On the linear complexity parameter and second order nonlinear filters.
- A wide family of nonlinear filter functions with a large linear span
This page was built for publication: Regular cosets and upper bounds on the linear complexity of certain sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4330621)