Characterising the linear complexity of span 1 de Bruijn sequences over finite fields.

DOI10.1006/jcta.1997.2822zbMath1115.94303OpenAlexW2089093353MaRDI QIDQ1380344

Peter A. Hines

Publication date: 1998

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

Full work available at URL: https://semanticscholar.org/paper/ca8d74c046b3989416d96c0b0fac9f580e1d8d31

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Finite fields (field-theoretic aspects) (12E20)

Related Items

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• There are no de Bruijn sequences of span \(n\) with complexity \(2^{n- 1}+n+1\)
• On the distribution of de Bruijn sequences of low complexity
• Some VLSI decompositions of the de Bruijn graph
• On the complexities of de-Bruijn sequences
• Permutation polynomials, de Bruijn sequences, and linear complexity
• On the distribution of de Bruijn sequences of given complexity
• A Survey of Full Length Nonlinear Shift Register Cycle Algorithms
• Optimal biphase sequences with large linear complexity derived from sequences over Z/sub 4/
• Shift-register synthesis and BCH decoding