Expected Value of the Linear Complexity of Two-Dimensional Binary Sequences
From MaRDI portal
Recommendations
- Expected values for the rational complexity of finite binary sequences
- scientific article; zbMATH DE number 26870
- Asymptotic Behavior of Normalized Linear Complexity of Multi-sequences
- On the expected value of the linear complexity and the k-error linear complexity of periodic sequences
- On the Stability of<tex>$2^n$</tex>-Periodic Binary Sequences
Cited in
(11)- Periodic multisequences with large error linear complexity
- Convergence of the Brun algorithm over the field of formal power series
- Joint linear complexity of multisequences consisting of linear recurring sequences
- The minimal polynomial over \(\mathbb F_q\) of linear recurring sequence over \(\mathbb F_{q^m}\)
- Expected values for the rational complexity of finite binary sequences
- Classification and counting on multi-continued fractions and its application to multi-sequences
- Levels of multi-continued fraction expansion of multi-formal Laurent series
- On the linear complexity of binary lattices
- Improved results on the probabilistic theory of the joint linear complexity of multisequences
- Asymptotic Behavior of Normalized Linear Complexity of Multi-sequences
- Error linear complexity measures for multisequences
This page was built for publication: Expected Value of the Linear Complexity of Two-Dimensional Binary Sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5450819)
