scientific article
From MaRDI portal
Publication:3797089
zbMath0651.94003MaRDI QIDQ3797089
Publication date: 1988
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (26)
Jump and hop randomness tests for binary sequences ⋮ On distribution properties of sequences with perfect linear complexity profile ⋮ Pseudorandom sequences derived from automatic sequences ⋮ Orthogonal sequences of polynomials over arbitrary fields ⋮ The minimal polynomial of a sequence obtained from the componentwise linear transformation of a linear recurring sequence ⋮ Numeration and discrete dynamical systems ⋮ The independence of two randomness properties of sequences over finite fields ⋮ ON THE -ERROR LINEAR COMPLEXITY OF SEQUENCES FROM FUNCTION FIELDS ⋮ Linear recurring sequences and subfield subcodes of cyclic codes ⋮ A combinatorial approach to probabilistic results on the linear- complexity profile of random sequences ⋮ A lower bound on a quantity related to the quality of polynomial lattices ⋮ On sequences, rational functions and decomposition ⋮ On the \(N\)th linear complexity of automatic sequences ⋮ Perfect linear complexity profile and apwenian sequences ⋮ Multisequences with almost perfect linear complexity profile and function fields over finite fields ⋮ Enumeration results on linear complexity profiles and lattice profiles ⋮ On the joint linear complexity profile of explicit inversive multisequences ⋮ Multi-sequences with \(d\)-perfect property ⋮ Multi-continued fraction algorithm and generalized B--M algorithm over \(\mathbb F_{q}\) ⋮ Generalized Joint Linear Complexity of Linear Recurring Multisequences ⋮ Continued fraction for formal Laurent series and the lattice structure of sequences ⋮ Linear complexity over \(\mathbb F_q\) and over \(\mathbb F_{q^m}\) for linear recurring sequences ⋮ Criteria for apwenian sequences ⋮ Linear complexity of generalized cyclotomic binary sequences of order 2 ⋮ Polynomials with odd orthogonal multiplicity ⋮ Counting functions and expected values for the lattice profile at \(n\)
This page was built for publication:
