On the lower bound of the linear complexity over F/sub p/ of Sidelnikov sequences

DOI10.1109/TIT.2006.876352zbMath1296.94073OpenAlexW1977021660MaRDI QIDQ3546903

Arne Winterhof, Florian Luca, Moubariz Z. Garaev, Igor E. Shparlinski

Publication date: 21 December 2008

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.2006.876352

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)

Related Items (12)

On the k-error linear complexity of binary sequences derived from polynomial quotients ⋮ On squares in polynomial products ⋮ Character values of the Sidelnikov-Lempel-Cohn-Eastman sequences ⋮ On the pseudorandom properties of \(k\)-ary Sidel'nikov sequences ⋮ Addendum to Sidel'nikov sequences over nonprime fields ⋮ On the linear complexity of Sidel'nikov sequences over nonprime fields ⋮ Some notes on the linear complexity of Sidel'nikov-Lempel-Cohn-Eastman sequences ⋮ Polynomial representations of the Lucas logarithm ⋮ On the k-error Linear Complexity of Subsequences of d-ary Sidel’nikov Sequences Over Prime Field 𝔽d ⋮ 𝑘-error linear complexity over 𝔽 p of subsequences of Sidelnikov sequences of period (pr – 1)/3 ⋮ On the linear complexity of bounded integer sequences over different moduli ⋮ Additive character sums of polynomial quotients

This page was built for publication: On the lower bound of the linear complexity over F/sub p/ of Sidelnikov sequences