Pages that link to "Item:Q3452366"
From MaRDI portal
The following pages link to Linear Complexity of Periodic Sequences: A General Theory (Q3452366):
Displaying 18 items.
- The linear complexity of binary sequences of length \(2p\) with optimal three-level autocorrelation (Q894464) (← links)
- Revisiting the relationship between compositional sequence complexity and periodicity (Q936027) (← links)
- Composition of recursions and nonlinear complexity of periodic binary sequences (Q1009065) (← links)
- Joint linear complexity of multisequences consisting of linear recurring sequences (Q1032485) (← links)
- Factorization of determinants over finite fields and application in stream ciphers (Q1032496) (← links)
- The expected value of the joint linear complexity of periodic multisequences (Q1394937) (← links)
- On the algebraic structure of quasi-cyclic codes. IV: Repeated roots (Q2491275) (← links)
- The expectation and variance of the joint linear complexity of random periodic multisequences (Q2577529) (← links)
- Asymptotic Behavior of Normalized Linear Complexity of Ultimately Nonperiodic Binary Sequences (Q3546748) (← links)
- (Q3984072) (← links)
- Linear Complexity of Periodically Repeated Random Sequences (Q4037463) (← links)
- (Q4258576) (← links)
- Linear complexity of a sequence obtained from a periodic sequence by either substituting, inserting, or deleting k symbols within one period (Q4503559) (← links)
- Two-dimensional generalized discrete Fourier transform and related quasi-cyclic Reed--Solomon codes (Q4633757) (← links)
- On the k-Operation Linear Complexity of Periodic Sequences (Q5458219) (← links)
- A family of keystream generators with large linear complexity (Q5938956) (← links)
- On the structure of repeated-root polycyclic codes over local rings (Q6056443) (← links)
- A generalization of the pascal matrix and an application to coding theory (Q6561287) (← links)
