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.
On a Convolution of Linear Recurring Sequences over Finite Fields, II
โ Scribed by P. Haukkanen
- Publisher
- Elsevier Science
- Year
- 1994
- Tongue
- English
- Weight
- 82 KB
- Volume
- 164
- Category
- Article
- ISSN
- 0021-8693
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
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
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
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
The largest possible number of representations of an integer in the k-fold sumset kA=A+ } } } +A is maximal for A being an arithmetic progression. More generally, consider the number of solutions of the linear equation where c i {0 and \* are fixed integer coefficients, and where the variables a i