On the Minimum Linear Complexity of de Bruijn Sequences over Non-prime Finite Fields

Peter A. Hines
1999 Journal of combinatorial theory. Series A  
It has been conjectured that over any non-prime finite field F p m and for any positive integer n, there exists a span n de Bruijn sequence over F p m which has the minimum possible linear complexity p nm&1 +n. We give a proof by construction that this conjecture is true.
doi:10.1006/jcta.1998.2920 fatcat:vw6tvc6spba23pb5vixaxyvwbu