Linear Complexity Over<tex>$F_p$</tex>of Sidel'nikov Sequences
From MaRDI portal
Publication:3546996
DOI10.1109/TIT.2004.834854zbMath1293.94050OpenAlexW2164379767MaRDI QIDQ3546996
Tor Helleseth, Martín Maas, Tim Segers, John Erik Mathiassen
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.2004.834854
Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)
Related Items (10)
On the k-error linear complexity of binary sequences derived from polynomial quotients ⋮ On the \(k\)-error linear complexity over \({\mathbb F}_p\) of Legendre and Sidelnikov sequences ⋮ Character values of the Sidelnikov-Lempel-Cohn-Eastman sequences ⋮ On the pseudorandom properties of \(k\)-ary Sidel'nikov sequences ⋮ The exact autocorrelation distribution and 2-adic complexity of a class of binary sequences with almost optimal autocorrelation ⋮ 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 ⋮ On the linear complexity of bounded integer sequences over different moduli ⋮ Additive character sums of polynomial quotients
This page was built for publication: Linear Complexity Over<tex>$F_p$</tex>of Sidel'nikov Sequences
