Linear Complexity Over<tex>F_p</tex>of Sidel'nikov Sequences

DOI10.1109/TIT.2004.834854MaRDI QIDQ3546996zbMATH OpenOpenAlexFDO

Authors Tor Helleseth, Martín Maas, John Erik Mathiassen, Tim Segers

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

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)

Recommendations

On the Linear Complexity of Sidel’nikov Sequences over ${\mathbb {F}}_d$
On the linear complexity of Sidel'nikov sequences over nonprime fields
Linear Complexity over F p of Ternary Sidel’nikov Sequences
𝑘-error linear complexity over 𝔽 p of subsequences of Sidelnikov sequences of period (pr – 1)/3
One-Error Linear Complexity over F p of Sidelnikov Sequences

Cited in

(24)

Complexity of prime-dimensional sequences over a finite field
On the linear complexity of bounded integer sequences over different moduli
On the linear complexity of the Sidelnikov-Lempel-Cohn-Eastman sequences
The exact autocorrelation distribution and 2-adic complexity of a class of binary sequences with almost optimal autocorrelation
On the linear complexity of Legendre-Sidelnikov sequences
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
On the linear complexity of multisequences, bijections between Zahlen and Number tuples, and partitions
A combinatorial proof of S-adicity for sequences with linear complexity
Additive character sums of polynomial quotients
𝑘-error linear complexity over 𝔽 p of subsequences of Sidelnikov sequences of period (pr – 1)/3
On the Linear Complexity of Sidel’nikov Sequences over ${\mathbb {F}}_d$
Linear Complexity over F p of Ternary Sidel’nikov Sequences
Bounds on the Linear Complexity and the 1-Error Linear Complexity over F p of M-ary Sidel’nikov Sequences
On the lower bound of the linear complexity over F/sub p/ of Sidelnikov sequences
Linear complexity over F/sub P/ and trace representation of Lempel-Cohn-Eastman sequences
On the k-error linear complexity of binary sequences derived from polynomial quotients
The straight line complexity of small factorials and primorials
One-Error Linear Complexity over F p of Sidelnikov Sequences
On the pseudorandom properties of k-ary Sidel'nikov sequences
Balance, pattern distribution and linear complexity of $M$-ary sequences from Sidel'nikov sequences
On the $k$-error linear complexity over ${\mathbb F}_p$ of Legendre and Sidelnikov sequences
On the linear complexity of Sidel'nikov sequences over nonprime fields

This page was built for publication: Linear Complexity Over<tex>$F_p$</tex>of Sidel'nikov Sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3546996)