On the linear complexity of nonlinearly filtered pn-sequences
From MaRDI portal
Publication:3547152
DOI10.1109/TIT.2003.818400zbMATH Open1301.94099OpenAlexW2130257933MaRDI QIDQ3547152FDOQ3547152
Authors: Nicholas Kolokotronis, N. Kalouptsidis
Publication date: 21 December 2008
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.2003.818400
Recommendations
Cited In (27)
- Nonlinear Complexity of Binary Sequences and Connections with Lempel-Ziv Compression
- On the linear complexity parameter and second order nonlinear filters.
- A wide family of nonlinear filter functions with a large linear span
- Finite length sequences with large nonlinear complexity
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Coding and Cryptography
- On the general classification of nonlinear filters of \(m\)-sequences
- On the linear complexity of the sequences generated by nonlinear filterings
- Title not available (Why is that?)
- On the linear complexity of nonuniformity decimated PN-sequences
- Binary sequences with period \(N\) and nonlinear complexity \(N - 2\)
- On the Classification of Periodic Binary Sequences into Nonlinear Complexity Classes
- An efficient algorithm to generate binary sequences for cryptographic purposes
- Lower Bounds on Sequence Complexity Via Generalised Vandermonde Determinants
- Factorization of determinants over finite fields and application in stream ciphers
- A new complexity metric for FH/SS sequences using fuzzy entropy
- Title not available (Why is that?)
- Linearity properties of binary FCSR sequences
- Linear complexity of generalized sequences by comparison of PN-sequences
- Linear span analysis of a set of periodic sequence generators
- Cryptographic properties of nonlinear pseudorandom number generators
- Improved Bounds on the Linear Complexity of Keystreams Obtained by Filter Generators
- Title not available (Why is that?)
- The nonlinear complexity of level sequences over \(\mathbb Z/(4)\)
This page was built for publication: On the linear complexity of nonlinearly filtered pn-sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3547152)