On the lower bound of the linear complexity over F/sub p/ of Sidelnikov sequences
From MaRDI portal
Publication:3546903
DOI10.1109/TIT.2006.876352zbMath1296.94073MaRDI 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
11T71: Algebraic coding theory; cryptography (number-theoretic aspects)
94A55: Shift register sequences and sequences over finite alphabets in information and communication theory
Related Items
On the k-error Linear Complexity of Subsequences of d-ary Sidel’nikov Sequences Over Prime Field 𝔽d, On the k-error linear complexity of binary sequences derived from polynomial quotients, On the pseudorandom properties of \(k\)-ary Sidel'nikov sequences, On squares in polynomial products, On the linear complexity of Sidel'nikov sequences over nonprime fields, On the linear complexity of bounded integer sequences over different moduli, Character values of the Sidelnikov-Lempel-Cohn-Eastman sequences, Addendum to 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, Additive character sums of polynomial quotients, 𝑘-error linear complexity over 𝔽 p of subsequences of Sidelnikov sequences of period (pr – 1)/3