Title of article
On the Minimum Linear Complexity of de Bruijn Sequences over Non-prime Finite Fields
Author/Authors
Hines، نويسنده , , Peter A.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1999
Pages
13
From page
127
To page
139
Abstract
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.
Journal title
Journal of Combinatorial Theory Series A
Serial Year
1999
Journal title
Journal of Combinatorial Theory Series A
Record number
1530370
Link To Document