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

On the linear complexity of generalized cyclotomic sequences with the period

โœ Scribed by Tongjiang Yan; Shengqiang Li; Guozhen Xiao

Publisher
Elsevier Science
Year
2008
Tongue
English
Weight
178 KB
Volume
21
Category
Article
ISSN
0893-9659

No coin nor oath required. For personal study only.

โœฆ Synopsis

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 sequences have high linear complexity.

๐Ÿ“œ SIMILAR VOLUMES

Linear Complexity of Generalized Cycloto
Linear Complexity of Generalized Cyclotomic Binary Sequences of Order 2
โœ Cunsheng Ding ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 233 KB

There are several kinds of cyclotomic sequences. They have a number of good randomness properties. In this paper we calculate the linear complexity (linear span) of generalized cyclotomic binary sequences of order 2. Our results show that their linear complexity is quite good.

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.