Permutation polynomials, de Bruijn sequences, and linear complexity

DOI10.1006/JCTA.1996.0088MaRDI QIDQ1924236zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

de Bruijn sequencefinite fieldslinear complexitypermutation polynomialslinear recurrence

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Recurrences (11B37)

Recommendations

• Characterising the linear complexity of span 1 de Bruijn sequences over finite fields.
• Linear complexity of de Bruijn sequences-old and new results
• On the minimum linear complexity of de Bruijn sequences over non-prime finite fields
• On the distribution of de Bruijn sequences of low complexity

Cited in

(21)

• Linear difference equations and periodic sequences over finite fields
• Roulette games and depths of words over finite commutative rings
• Preliminary results on the minimal polynomial of modified de Bruijn sequences
• Linear complexity and expansion complexity of some number theoretic sequences
• scientific article; zbMATH DE number 4042032 (Why is no real title available?)
• The minimal polynomials of modified de Bruijn sequences revisited
• Minimal polynomials of the modified de Bruijn sequences
• Cyclotomic Mapping Permutation Polynomials over Finite Fields
• Characterising the linear complexity of span 1 de Bruijn sequences over finite fields.
• 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
• Factor complexity and permutation complexity of the generalized Morse sequence
• Some notes on the linear complexity of Sidel'nikov-Lempel-Cohn-Eastman sequences
• On the Carlitz rank of permutations of \(\mathbb F_q\) and pseudorandom sequences
• On the \(k\)-error linear complexity of binary sequences derived from the discrete logarithm in finite fields
• On the linear complexity profile of explicit nonlinear pseudorandom numbers.
• On the minimum linear complexity of de Bruijn sequences over non-prime finite fields
• On the linear complexity profile of nonlinear congruential pseudorandom number generators of higher orders
• Construction of de Bruijn sequences of minimal complexity
• Additive character sums of polynomial quotients
• Expansion complexity and linear complexity of sequences over finite fields

This page was built for publication: Permutation polynomials, de Bruijn sequences, and linear complexity

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