𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Sequences With Subword Complexity 2n

✍ Scribed by G. Rote

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
716 KB
Volume
46
Category
Article
ISSN
0022-314X

No coin nor oath required. For personal study only.

✦ Synopsis

We construct and discuss infinite 0 - 1 -sequences which contain (2 n) different subwords of length (n), for every (n . \quad) ' 1994 Academic Press, Inc.

πŸ“œ 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 linear complexity of generalized
On the linear complexity of generalized cyclotomic sequences with the period
✍ 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