On the minimum linear complexity of de Bruijn sequences over non-prime finite fields
From MaRDI portal
Publication:1284473
DOI10.1006/jcta.1998.2920zbMath0929.11061OpenAlexW2068978958MaRDI QIDQ1284473
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
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Recurrences (11B37)
Cites Work
- Unnamed Item
- On the distribution of de Bruijn sequences of low complexity
- Perfect factors in the de Bruijn graph
- Characterising the linear complexity of span 1 de Bruijn sequences over finite fields.
- 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
- Construction of de Bruijn sequences of minimal complexity