✦ LIBER ✦

On the lower bound of the linear complexity over Fp of Sidelnikov sequences

✍ Scribed by Garaev, M.Z.; Luca, F.; Shparlinski, I.E.; Winterhof, A.

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Linear complexity over Fp of Sidel'nikov

✍ Helleseth, T.; Maas, M.; Mathiassen, J.E.; Segers, T. 📂 Article 📅 2004 🏛 IEEE 🌐 English ⚖ 242 KB

On the Linear Complexity of the Sidelnik

✍ Gohar M. Kyureghyan; Alexander Pott 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 104 KB

Linear complexity over Fp and trace repr

✍ Helleseth, T.; Sang-Hyo Kim; Jong-Seon No 📂 Article 📅 2003 🏛 IEEE 🌐 English ⚖ 335 KB

A Lower Bound on the Complexity of Polyn

✍ Kaminski, Michael 📂 Article 📅 2005 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 338 KB

Lower bounds of the complexity of linear

✍ Dario Bini; Milvio Capovani 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 243 KB

On the linear complexity of Legendre seq

✍ Cunsheng Ding; Hesseseth, T.; Weijuan Shan 📂 Article 📅 1998 🏛 IEEE 🌐 English ⚖ 121 KB