Publication:3797089
From MaRDI portal
zbMath0651.94003MaRDI QIDQ3797089
Publication date: 1988
94A60: Cryptography
Related Items
ON THE -ERROR LINEAR COMPLEXITY OF SEQUENCES FROM FUNCTION FIELDS, Multisequences with almost perfect linear complexity profile and function fields over finite fields, On distribution properties of sequences with perfect linear complexity profile, 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 sequences, rational functions and decomposition, On the joint linear complexity profile of explicit inversive multisequences, A lower bound on a quantity related to the quality of polynomial lattices, A combinatorial approach to probabilistic results on the linear- complexity profile of random sequences, Linear complexity of generalized cyclotomic binary sequences of order 2, Polynomials with odd orthogonal multiplicity, Orthogonal sequences of polynomials over arbitrary fields, On the \(N\)th linear complexity of automatic sequences, Multi-sequences with \(d\)-perfect property, Perfect linear complexity profile and apwenian sequences, Criteria for apwenian sequences, Jump and hop randomness tests for binary sequences, Pseudorandom sequences derived from automatic sequences, Linear recurring sequences and subfield subcodes of cyclic codes, Enumeration results on linear complexity profiles and lattice profiles, Multi-continued fraction algorithm and generalized B--M algorithm over \(\mathbb F_{q}\), 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, Counting functions and expected values for the lattice profile at \(n\), Generalized Joint Linear Complexity of Linear Recurring Multisequences
