The following pages link to Nicholas Kolokotronis (Q1008989):
Displayed 21 items.
- Item:Q1008989 (redirect page) (← links)
- On the generation of sequences simulating higher order white noise for system identification (Q951533) (← links)
- Cryptographic properties of nonlinear pseudorandom number generators (Q1008990) (← links)
- Factorization of determinants over finite fields and application in stream ciphers (Q1032496) (← links)
- De Bruijn sequences and suffix arrays: analysis and constructions (Q1624990) (← links)
- Boolean functions with maximum algebraic immunity: further extensions of the Carlet-Feng construction (Q1650428) (← links)
- Secondary constructions of Boolean functions with maximum algebraic immunity (Q2392688) (← links)
- Boolean Functions with Maximum Algebraic Immunity Based on Properties of Punctured Reed–Muller Codes (Q2802411) (← links)
- Nonlinear Complexity of Binary Sequences and Connections with Lempel-Ziv Compression (Q3541919) (← links)
- Lower Bounds on Sequence Complexity Via Generalised Vandermonde Determinants (Q3541929) (← links)
- On the linear complexity of nonlinearly filtered pn-sequences (Q3547152) (← links)
- On the Quadratic Span of Binary Sequences (Q3547560) (← links)
- On the Nonlinear Complexity and Lempel–Ziv Complexity of Finite Length Sequences (Q3549099) (← links)
- Improved Bounds on the Linear Complexity of Keystreams Obtained by Filter Generators (Q3600338) (← links)
- On the Linear Complexity of Sequences Obtained by State Space Generators (Q3604535) (← links)
- (Q4421637) (← links)
- Minimum linear span approximation of binary sequences (Q4677596) (← links)
- Properties of the Error Linear Complexity Spectrum (Q4974028) (← links)
- Best Affine and Quadratic Approximations of Particular Classes of Boolean Functions (Q4974070) (← links)
- The Error Linear Complexity Spectrum as a Cryptographic Criterion of Boolean Functions (Q5211579) (← links)
- Efficient Computation of the Best Quadratic Approximations of Cubic Boolean Functions (Q5447509) (← links)