✦ LIBER ✦

Perfect staircase profile of linear complexity for finite sequences

✍ Scribed by Masakatu Morii; Masao Kasahara

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 336 KB
Volume: 44
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(92)90190-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

New binary sequences with perfect stairc

New binary sequences with perfect staircase profile of linear complexity

✍ Yi Xian Yang 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 217 KB

Constructions of Sequences with Almost P

Constructions of Sequences with Almost Perfect Linear Complexity Profile from Curves over Finite Fields

✍ Chaoping Xing; Harald Niederreiter; Kwok Yan Lam; Cunsheng Ding 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 118 KB

Sequences with almost perfect linear complexity pro"le are of importance for the linear complexity theory of sequences. In this paper we present several constructions of sequences with almost perfect linear complexity pro"le based on algebraic curves over "nite "elds. Moreover, some interesting cons

Multi-sequences with Almost Perfect Line

Multi-sequences with Almost Perfect Linear Complexity Profile and Function Fields over Finite Fields

✍ Chaoping Xing 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 147 KB

Linear Complexity Profiles: Hausdorff Di

Linear Complexity Profiles: Hausdorff Dimensions for Almost Perfect Profiles and Measures for General Profiles

✍ Harald Niederreiter; Michael Vielhaber 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 252 KB

Stream ciphers usually employ some sort of pseudorandomly generated bit strings to be added to the plaintext. The cryptographic properties of such a sequence a can be stated in terms of the so-called linear complexity profile (l.c.p.), ), it is called (almost) perfect. This paper examines first thos

Characterising the Linear Complexity of

Characterising the Linear Complexity of Span 1 de Bruijn Sequences over Finite Fields

✍ Peter A. Hines 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 307 KB

We give a complete resolution to a conjecture regarding the characterisation of linear complexities of span 1 de Bruijn sequences over nonprime finite fields. This contrasts with results for prime fields, where the characterisation is equivalent to an open question concerning permutation polynomials

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.