Pages that link to "Item:Q914648"
From MaRDI portal
The following pages link to A combinatorial approach to probabilistic results on the linear- complexity profile of random sequences (Q914648):
Displaying 12 items.
- On distribution properties of sequences with perfect linear complexity profile (Q294765) (← links)
- On the limit of maximal density of sequences with a perfect linear complexity profile (Q676731) (← links)
- Enumeration results on the joint linear complexity of multisequences (Q998652) (← links)
- Perfect staircase profile of linear complexity for finite sequences (Q1201870) (← links)
- Linear complexity of generalized cyclotomic binary sequences of order 2 (Q1266420) (← links)
- A probabilistic analysis of a measure of combinatorial complexity for the central curve (Q1970302) (← links)
- A linear-time algorithm for computing the multinomial stochastic complexity (Q2379977) (← links)
- Successive minima profile, lattice profile, and joint linear complexity profile of pseudorandom multisequences (Q2483203) (← links)
- Enumeration results on linear complexity profiles and lattice profiles (Q2489145) (← links)
- A combinatorial proof of \(S\)-adicity for sequences with linear complexity (Q2855577) (← links)
- Expected π-Adic Security Measures of Sequences (Q3600443) (← links)
- Linear Complexity of Periodically Repeated Random Sequences (Q4037463) (← links)