The Probabilistic Theory of Linear Complexity

Recommendations

A combinatorial approach to probabilistic results on the linear- complexity profile of random sequences
Linear Complexity and Random Sequences
Keystream Sequences with a Good Linear Complexity Profile for Every Starting Point
scientific article; zbMATH DE number 177032
Linear complexity profiles: Hausdorff dimensions for almost perfect profiles and measures for general profiles

Cited in

(42)

Cantor sets determined by partial quotients of continued fractions of Laurent series
Beta-expansion and continued fraction expansion over formal Laurent series
A combinatorial approach to probabilistic results on the linear- complexity profile of random sequences
Probabilistic results on the 2-adic complexity
On metric Diophantine approximation in the field of formal Laurent series
Hausdorff dimension of the recurrence sets of Gauss transformation on the field of Laurent series
scientific article; zbMATH DE number 4045477 (Why is no real title available?)
The independence of two randomness properties of sequences over finite fields
Probabilistic complexity analysis for linear problems in bounded domains
On the pseudorandomness of automatic sequences
Metrical properties for continued fractions of formal Laurent series
An analogue of a theorem of Szüsz for formal Laurent series over finite fields.
Perfect linear complexity profile and apwenian sequences
Jump and hop randomness tests for binary sequences
Probabilistic Recursion Theory and Implicit Computational Complexity
scientific article; zbMATH DE number 177032 (Why is no real title available?)
The statistics of continued fractions for polynomials over a finite field
Continued fraction for formal Laurent series and the lattice structure of sequences
On the joint linear complexity profile of explicit inversive multisequences
On the relation between descriptional complexity and algorithmic probability
Enumeration results on linear complexity profiles and lattice profiles
Kurzweil type metrical Diophantine properties in the field of formal Laurent series
Enumeration results on the joint linear complexity of multisequences
Metrical properties for the weighted sums of degrees of multiple partial quotients in continued fractions of Laurent series
A linear-time algorithm for computing the multinomial stochastic complexity
Multidimensional linear complexity analysis of periodic arrays
scientific article; zbMATH DE number 1504556 (Why is no real title available?)
On the quantitative metric theory of continued fractions in positive characteristic
The metric properties of Sylvester continued fraction expansions over the field of formal Laurent series
On sums of degrees of the partial quotients in continued fraction expansions of Laurent series
On the relative growth rate of the product of consecutive partial quotients in continued fraction expansions of Laurent series
On the Structure of Logspace Probabilistic Complexity Classes
On the \(\delta \to 0\) limit in probabilistic complexity
Keystream Sequences with a Good Linear Complexity Profile for Every Starting Point
Linear complexity and related complexity measures
Pseudorandom sequences derived from automatic sequences
On sets of exact Diophantine approximation over the field of formal series
Hausdorff dimensions of bounded-type continued fraction sets of Laurent series
Kronecker-Halton sequences in \(\mathbb{F}_p((X^{-1}))\)
Some notes on the pseudorandomness of Legendre symbol and Liouville function
Expansion complexity and linear complexity of sequences over finite fields
Counting functions and expected values for the lattice profile at \(n\)

This page was built for publication: The Probabilistic Theory of Linear Complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3807118)