On the k-error linear complexity of binary sequences derived from polynomial quotients
From MaRDI portal
Publication:5046474
DOI10.1007/s11432-014-5220-7zbMath1497.94067arXiv1307.6626OpenAlexW2282058484MaRDI QIDQ5046474
Chenhuang Wu, Zhihua Niu, Zhixiong Chen
Publication date: 28 October 2022
Published in: Science China Information Sciences (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1307.6626
Related Items
On \(k\)-error linear complexity of pseudorandom binary sequences derived from Euler quotients, Trace representation of pseudorandom binary sequences derived from Euler quotients, On error linear complexity of new generalized cyclotomic binary sequences of period \(p^2\), A further study of the linear complexity of new binary cyclotomic sequence of length \(p^r\), Trace representation of the binary \(pq^2\)-periodic sequences derived from Euler quotients
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear complexity of binary sequences derived from Euler quotients with prime-power modulus
- Linear complexity of pseudorandom sequences generated by Fermat quotients and their generalizations
- Multiplicative character sums of Fermat quotients and pseudorandom sequences
- Boolean functions derived from Fermat quotients
- How many bits have to be changed to decrease the linear complexity?
- On the \(k\)-error linear complexity over \({\mathbb F}_p\) of Legendre and Sidelnikov sequences
- The stability theory of stream ciphers
- Linear complexity of generalized cyclotomic binary sequences of order 2
- Fermat quotients for composite moduli
- Trace representation and linear complexity of binary sequences derived from Fermat quotients
- Permutation polynomials, de Bruijn sequences, and linear complexity
- On the linear complexity of binary threshold sequences derived from Fermat quotients
- On the divisibility of Fermat quotients
- Additive character sums of polynomial quotients
- ON THE DISTRIBUTION OF PSEUDORANDOM NUMBERS AND VECTORS DERIVED FROM EULER–FERMAT QUOTIENTS
- Linear Complexity of Binary Sequences Derived from Polynomial Quotients
- BOUNDS OF MULTIPLICATIVE CHARACTER SUMS WITH FERMAT QUOTIENTS OF PRIMES
- Pseudorandomness and Dynamics of Fermat Quotients
- CHARACTER SUMS WITH FERMAT QUOTIENTS
- Fermat quotients: exponential sums, value set and primitive roots
- Short character sums with Fermat quotients
- 𝑘-error linear complexity over 𝔽 p of subsequences of Sidelnikov sequences of period (pr – 1)/3
- 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<tex>$F_p$</tex>of Sidel'nikov Sequences
- On the Linear Complexity and $k$-Error Linear Complexity Over $ {\BBF }_{p}$ of the $d$-ary Sidel'nikov Sequence
- Structure of Pseudorandom Numbers Derived from Fermat Quotients
- An algorithm for the k-error linear complexity of binary sequences with period 2/sup n/
- On the 𝑝-divisibility of Fermat quotients
- Linear complexity over F/sub P/ and trace representation of Lempel-Cohn-Eastman sequences
- Autocorrelation values of generalized cyclotomic sequences of order two
- Properties of the Error Linear Complexity Spectrum
- Interpolation of Fermat Quotients
- On the value set of Fermat quotients
- On the k-error linear complexity of cyclotomic sequences
- One-Error Linear Complexity over F p of Sidelnikov Sequences
- Shift-register synthesis and BCH decoding
- A search for Wieferich and Wilson primes
