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

Thek-error linear complexity and the linear complexity forpqn-periodic binary sequences

โœ Scribed by Zhu Fengxiang; Qi Wenfeng

Publisher
Wuhan University
Year
2006
Tongue
English
Weight
393 KB
Volume
11
Category
Article
ISSN
1007-1202

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Counting Functions and Expected Values f
Counting Functions and Expected Values for the k-Error Linear Complexity
โœ Wilfried Meidl; Harald Niederreiter ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 126 KB

In cryptology, complexity measures for sequences of elements of a "nite "eld, such as the linear complexity, play an important role. Cryptographically strong sequences or "nite strings must not only have a large linear complexity, but also the change of a few terms must not cause a signi"cant decrea

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