๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Linear complexity of de Bruijn sequences-old and new results

โœ Scribed by Etzion, T.

Book ID
114541183
Publisher
IEEE
Year
1999
Tongue
English
Weight
301 KB
Volume
45
Category
Article
ISSN
0018-9448

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Permutation Polynomials, de Bruijn Seque
Permutation Polynomials, de Bruijn Sequences, and Linear Complexity
โœ Simon R. Blackburn; Tuvi Etzion; Kenneth G. Paterson ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 837 KB

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

Characterising the Linear Complexity of
Characterising the Linear Complexity of Span 1 de Bruijn Sequences over Finite Fields
โœ Peter A. Hines ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 307 KB

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

On the Minimum Linear Complexity of de B
On the Minimum Linear Complexity of de Bruijn Sequences over Non-prime Finite Fields
โœ Peter A. Hines ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 126 KB

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.