Pages that link to "Item:Q3541901"
From MaRDI portal
The following pages link to Sequences and Their Applications – SETA 2006 (Q3541901):
Displayed 36 items.
- Shift Register Sequences – A Retrospective Account (Q3541902) (← links)
- The Probabilistic Theory of the Joint Linear Complexity of Multisequences (Q3541903) (← links)
- Multi-Continued Fraction Algorithms and Their Applications to Sequences (Q3541904) (← links)
- Codes for Optical CDMA (Q3541906) (← links)
- On the Linear Complexity of Sidel’nikov Sequences over ${\mathbb {F}}_d$ (Q3541907) (← links)
- Linear Complexity over F p of Ternary Sidel’nikov Sequences (Q3541909) (← links)
- Bounds on the Linear Complexity and the 1-Error Linear Complexity over F p of M-ary Sidel’nikov Sequences (Q3541910) (← links)
- The Characterization of 2 n -Periodic Binary Sequences with Fixed 1-Error Linear Complexity (Q3541911) (← links)
- Crosscorrelation Properties of Binary Sequences with Ideal Two-Level Autocorrelation (Q3541912) (← links)
- Extended Hadamard Equivalence (Q3541913) (← links)
- Analysis of Designing Interleaved ZCZ Sequence Families (Q3541914) (← links)
- Security of Jump Controlled Sequence Generators for Stream Ciphers (Q3541915) (← links)
- Improved Rijndael-Like S-Box and Its Transform Domain Analysis (Q3541918) (← links)
- Nonlinear Complexity of Binary Sequences and Connections with Lempel-Ziv Compression (Q3541919) (← links)
- On Lempel-Ziv Complexity of Sequences (Q3541920) (← links)
- Computing the k-Error N-Adic Complexity of a Sequence of Period p n (Q3541921) (← links)
- On the Expected Value of the Joint 2-Adic Complexity of Periodic Binary Multisequences (Q3541922) (← links)
- On the Classification of Periodic Binary Sequences into Nonlinear Complexity Classes (Q3541923) (← links)
- Sequences of Period 2 N –2 (Q3541924) (← links)
- A New Algorithm to Compute Remote Terms in Special Types of Characteristic Sequences (Q3541926) (← links)
- Implementation of Multi-continued Fraction Algorithm and Application to Multi-sequence Linear Synthesis (Q3541927) (← links)
- The Hausdorff Dimension of the Set of r-Perfect M-Multisequences (Q3541928) (← links)
- Lower Bounds on Sequence Complexity Via Generalised Vandermonde Determinants (Q3541929) (← links)
- Construction of Pseudo-random Binary Sequences from Elliptic Curves by Using Discrete Logarithm (Q3541930) (← links)
- On the Discrepancy and Linear Complexity of Some Counter-Dependent Recurrence Sequences (Q3541931) (← links)
- Nonexistence of a Kind of Generalized Perfect Binary Array (Q3541932) (← links)
- On the Distinctness of Decimations of Generalized l-Sequences (Q3541933) (← links)
- On FCSR Memory Sequences (Q3541934) (← links)
- Periodicity and Distribution Properties of Combined FCSR Sequences (Q3541935) (← links)
- Generalized Bounds on Partial Aperiodic Correlation of Complex Roots of Unity Sequences (Q3541936) (← links)
- Chip-Asynchronous Version of Welch Bound: Gaussian Pulse Improves BER Performance (Q3541937) (← links)
- On Immunity Profile of Boolean Functions (Q3541938) (← links)
- Reducing the Number of Homogeneous Linear Equations in Finding Annihilators (Q3541939) (← links)
- The Algebraic Normal Form, Linear Complexity and k-Error Linear Complexity of Single-Cycle T-Function (Q3541940) (← links)
- Partially Perfect Nonlinear Functions and a Construction of Cryptographic Boolean Functions (Q3541941) (← links)
- Construction of 1-Resilient Boolean Functions with Very Good Nonlinearity (Q3541942) (← links)