✦ LIBER ✦

On a convolution of linear recurring sequences over finite fields

✍ Scribed by Pentti Haukkanen

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 179 KB
Volume: 149
Category: Article
ISSN: 0021-8693
DOI: 10.1016/0021-8693(92)90011-a

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On a Convolution of Linear Recurring Seq

On a Convolution of Linear Recurring Sequences over Finite Fields, II

✍ P. Haukkanen 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 82 KB

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.

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

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

A Remark on the Minimal Polynomial of th

A Remark on the Minimal Polynomial of the Product of Linear Recurring Sequences

✍ Emrah Çakçak 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 270 KB

On Value Sets of Polynomials over a Fini

On Value Sets of Polynomials over a Finite Field

✍ Wayne Aitken 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 254 KB

We study value sets of polynomials over a finite field, and value sets associated to pairs of such polynomials. For example, we show that the value sets (counting multiplicities) of two polynomials of degree at most d are identical or have at most q!(q!1)/d values in common where q is the number of