On the complexities of de Bruijn sequences
β Scribed by Agnes Hui Chan; Richard A Games; Edwin L Key
- Publisher
- Elsevier Science
- Year
- 1982
- Tongue
- English
- Weight
- 576 KB
- Volume
- 33
- Category
- Article
- ISSN
- 0097-3165
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
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.
The paper establishes a connection between the theory of permutation polynomials and the question of whether a de Bruijn sequence over a general finite field of a given linear complexity exists. The connection is used both to construct span 1 de Bruijn sequences (permutations) of a range of linear c
The cycle structure of the "connection" of feedback logics is applied to construct more polynomials which generate de Bruijn sequences.
Transposing an N\_N array that is distributed row-or columnwise across P=N processors is a fundamental communication task that requires timeconsuming interprocessor communication. It is the underlying communication task for the fast Fourier transform of long sequences and multidimensional arrays. It