Permutation polynomials, de Bruijn sequences, and linear complexity
From MaRDI portal
Publication:1924236
DOI10.1006/jcta.1996.0088zbMath0871.11089OpenAlexW2037656036MaRDI QIDQ1924236
Simon R. Blackburn, Tuvi Etzion, Kenneth G. Paterson
Publication date: 1 October 1997
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jcta.1996.0088
Related Items (17)
Roulette games and depths of words over finite commutative rings ⋮ On the k-error linear complexity of binary sequences derived from polynomial quotients ⋮ On the \(k\)-error linear complexity over \({\mathbb F}_p\) of Legendre and Sidelnikov sequences ⋮ Characterising the linear complexity of span 1 de Bruijn sequences over finite fields. ⋮ Preliminary results on the minimal polynomial of modified de Bruijn sequences ⋮ On the Carlitz rank of permutations of \(\mathbb F_q\) and pseudorandom sequences ⋮ Expansion complexity and linear complexity of sequences over finite fields ⋮ The minimal polynomials of modified de Bruijn sequences revisited ⋮ Some notes on the linear complexity of Sidel'nikov-Lempel-Cohn-Eastman sequences ⋮ Cyclotomic Mapping Permutation Polynomials over Finite Fields ⋮ On the minimum linear complexity of de Bruijn sequences over non-prime finite fields ⋮ On the \(k\)-error linear complexity of binary sequences derived from the discrete logarithm in finite fields ⋮ On the linear complexity profile of nonlinear congruential pseudorandom number generators of higher orders ⋮ On the linear complexity profile of explicit nonlinear pseudorandom numbers. ⋮ Additive character sums of polynomial quotients ⋮ Linear Complexity and Expansion Complexity of Some Number Theoretic Sequences ⋮ Linear difference equations and periodic sequences over finite fields
This page was built for publication: Permutation polynomials, de Bruijn sequences, and linear complexity
