On the distribution of de bruijn sequences of low complexity
โ Scribed by Tuvi Etzion
- Publisher
- Elsevier Science
- Year
- 1985
- Tongue
- English
- Weight
- 614 KB
- Volume
- 38
- Category
- Article
- ISSN
- 0097-3165
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Order n de Bruijn sequences are the period 2" binary sequences produced by an n stage feedback shift register. The de Bruijn sequences have good randomness and complexity properties. Theorems are given on the weight class distributions of the generator functions. Data that extend the work of Fredric
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.
We give a complete resolution to a conjecture regarding the characterisation of linear complexities of span 1 de Bruijn sequences over nonprime finite fields. This contrasts with results for prime fields, where the characterisation is equivalent to an open question concerning permutation polynomials