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

It has been conjectured that over any non-prime finite field Fpmand for any positive integer n, there exists a spannde Bruijn sequence over Fpmwhich has the minimum possible linear complexitypnm−1+n. We give a proof by construction that this conjecture is true.