✦ LIBER ✦

Characterising the Linear Complexity of Span 1 de Bruijn Sequences over Finite Fields

✍ Scribed by Peter A. Hines

Publisher: Elsevier Science
Year: 1998
Tongue: English
Weight: 307 KB
Volume: 81
Category: Article
ISSN: 0097-3165
DOI: 10.1006/jcta.1997.2822

No coin nor oath required. For personal study only.

✦ Synopsis

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.

📜 SIMILAR VOLUMES

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.

Constructions of Sequences with Almost P

Constructions of Sequences with Almost Perfect Linear Complexity Profile from Curves over Finite Fields

✍ Chaoping Xing; Harald Niederreiter; Kwok Yan Lam; Cunsheng Ding 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 118 KB

Sequences with almost perfect linear complexity pro"le are of importance for the linear complexity theory of sequences. In this paper we present several constructions of sequences with almost perfect linear complexity pro"le based on algebraic curves over "nite "elds. Moreover, some interesting cons