On the minimum linear complexity of de Bruijn sequences over non-prime finite fields

DOI10.1006/JCTA.1998.2920MaRDI QIDQ1284473zbMATH OpenOpenAlexFDO

Authors Peter A. Hines

Publication date 25 January 2000

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jcta.1998.2920

zbMATH Keywords

de Bruijn sequencesfinite fieldlinear complexity

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Recurrences (11B37)

Recommendations

• Construction of de Bruijn sequences of minimal complexity
• Linear complexity of de Bruijn sequences-old and new results
• Characterising the linear complexity of span 1 de Bruijn sequences over finite fields.
• The minimal polynomials of modified de Bruijn sequences revisited
• Permutation polynomials, de Bruijn sequences, and linear complexity

Cites work

• scientific article; zbMATH DE number 3882549 (Why is no real title available?)
• Characterising the linear complexity of span 1 de Bruijn sequences over finite fields.
• Construction of de Bruijn sequences of minimal complexity
• On the complexities of de-Bruijn sequences
• On the distribution of de Bruijn sequences of given complexity
• On the distribution of de Bruijn sequences of low complexity
• Perfect factors in the de Bruijn graph
• Permutation polynomials, de Bruijn sequences, and linear complexity

Cited in

(3)

• The minimal polynomials of modified de Bruijn sequences revisited
• Minimum Eulerian circuits and minimum de Bruijn sequences
• Construction of de Bruijn sequences of minimal complexity

This page was built for publication: On the minimum linear complexity of de Bruijn sequences over non-prime finite fields

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