𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Periodic Sequences with Maximal Linear Complexity and Largek-Error Linear Complexity

✍ Scribed by Wilfried Meidl; Harald Niederreiter

Publisher
Springer
Year
2003
Tongue
English
Weight
171 KB
Volume
14
Category
Article
ISSN
0938-1279

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Permutation Polynomials, de Bruijn Seque
Permutation Polynomials, de Bruijn Sequences, and Linear Complexity
✍ Simon R. Blackburn; Tuvi Etzion; Kenneth G. Paterson πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 837 KB

The paper establishes a connection between the theory of permutation polynomials and the question of whether a de Bruijn sequence over a general finite field of a given linear complexity exists. The connection is used both to construct span 1 de Bruijn sequences (permutations) of a range of linear c

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