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.
โฆ LIBER โฆ
Statistical characteristics of the complexity for prime-periodic sequences
โ Scribed by Niu Zhi-hua; Li Nai-cheng; Xiao Guo-zhen
- Publisher
- Wuhan University
- Year
- 2005
- Tongue
- English
- Weight
- 249 KB
- Volume
- 10
- Category
- Article
- ISSN
- 1007-1202
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
On the Minimum Linear Complexity of de B
โ
Peter A. Hines
๐
Article
๐
1999
๐
Elsevier Science
๐
English
โ 126 KB
The complexity of a periodic sequence ov
โ
Shenquan Xie
๐
Article
๐
1988
๐
Elsevier Science
๐
English
โ 556 KB
On the Behavior of Characteristic Multip
โ
L.N. Virgin; K.D. Murphy
๐
Article
๐
1994
๐
Elsevier Science
๐
English
โ 176 KB
On the linear complexity of generalized
โ
Tongjiang Yan; Shengqiang Li; Guozhen Xiao
๐
Article
๐
2008
๐
Elsevier Science
๐
English
โ 178 KB
This letter contributes to the investigation of the linear complexity of generalized cyclotomic sequences with the period p m , which are contained by the sequences constructed by C. Ding and T. Helleseth in 1998, as a representative special case. The results obtained confirm that all of these seque
The weak Burnside problem for Moufang lo
โ
A. N. Grishkov
๐
Article
๐
1988
๐
SP MAIK Nauka/Interperiodica
๐
English
โ 342 KB
On the upper bound for the number of pri
โ
J. Kan
๐
Article
๐
1991
๐
Springer Netherlands
๐
English
โ 327 KB