✦ LIBER ✦

On the complexity of recurring sequences

✍ Scribed by Marchenkov, S. S.

Book ID: 120137472
Publisher: Walter de Gruyter GmbH & Co. KG
Year: 2003
Tongue: English
Weight: 110 KB
Volume: 13
Category: Article
ISSN: 0924-9265
DOI: 10.1163/156939203322109122

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Products of linear recurring sequences w

Products of linear recurring sequences with maximum complexity

✍ Rueppel, R.; Staffelbach, O. 📂 Article 📅 1987 🏛 IEEE 🌐 English ⚖ 1022 KB

Joint linear complexity of multisequence

Joint linear complexity of multisequences consisting of linear recurring sequences

✍ Fang-Wei Fu; Harald Niederreiter; Ferruh Özbudak 📂 Article 📅 2008 🏛 Springer-Verlag 🌐 English ⚖ 570 KB

Joint linear complexity of arbitrary mul

Joint linear complexity of arbitrary multisequences consisting of linear recurring sequences

✍ Fang-Wei Fu; Harald Niederreiter; Ferruh Özbudak 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 303 KB

How to determine linear complexity andk-

How to determine linear complexity andk-error linear complexity in some classes of linear recurring sequences

✍ Wilfried Meidl 📂 Article 📅 2008 🏛 Springer-Verlag 🌐 English ⚖ 423 KB

A note on linear recurring sequences

✍ Surjeet Singh 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 154 KB

Decimations of linear recurring sequence

Decimations of linear recurring sequences

✍ M. Buck; N. Zierler 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 357 KB

We exploit a connection between decimations and products to deduce the generating polynomials of decimations of linear recurring sequences over an arbitrary field from known results concerning products. We also discuss ways of computing such polynomials.