scientific article; zbMATH DE number 1182117
From MaRDI portal
Publication:4400352
zbMATH Open0912.94014MaRDI QIDQ4400352FDOQ4400352
Authors: Cunsheng Ding, Tor Helleseth, Weijuan Shan 
Publication date: 26 May 1999
Title of this publication is not available (Why is that?)
Recommendations
Cryptography (94A60) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)
Cited In (56)
- Linear complexity of two classes of quaternary sequences based on sign alternation transformation
- Autocorrelation of the modified binary two-prime Sidelnikov sequence
- GLS: new class of generalized Legendre sequences with optimal arithmetic cross-correlation
- The linear complexity and 4-adic complexity of quaternary sequences with period \(pq\)
- On the pseudorandom properties of \(d\)-ary generalized two-prime Sidelnikov sequences
- Analysis and computation of multidimensional linear complexity of periodic arrays
- Linear complexity of Ding-Helleseth generalized cyclotomic sequences of order eight
- On the linear complexity and the autocorrelation of generalized cyclotomic binary sequences of length \(2p^m\)
- Linear complexity of Ding-Helleseth sequences of order 2 over \(\mathrm{GF}(l)\)
- Sequences related to Legendre/Jacobi sequences
- Title not available (Why is that?)
- The linear complexity of new generalized cyclotomic binary sequences of order four
- On the linear complexity of the Naor-Reingold sequence with elliptic curves
- About the linear complexity of quaternary sequences with even length
- New generalized cyclotomic binary sequences of period \(p^2\)
- On the linear complexity of Legendre-Sidelnikov sequences
- Recursion polynomials of unfolded sequences
- The exact autocorrelation distribution and 2-adic complexity of a class of binary sequences with almost optimal autocorrelation
- A new lower bound on the family complexity of Legendre sequences
- Permutation polynomials over finite fields from a powerful lemma
- An extension of binary cyclotomic sequences having order 2lt
- A new class of quaternary generalized cyclotomic sequences of order 2d and length 2pm with high linear complexity
- Linear complexity of quaternary sequences of length \(pq\) with low autocorrelation
- Binary sequences with period \(N\) and nonlinear complexity \(N - 2\)
- On the k-error linear complexity of binary sequences derived from polynomial quotients
- The linear complexity of generalized cyclotomic sequences with period \(2p^n\)
- Legendre Sequences and Modified Jacobi Sequences
- Linear complexity of generalized cyclotomic binary sequences of length \(2p^{m}\)
- Multidimensional linear complexity analysis of periodic arrays
- About computation of the linear complexity of generalized cyclotomic sequences with period \(p^{n+1}\)
- Remarks on a cyclotomic sequence
- Linear complexity of a class of pseudorandom sequences over a general finite field
- On the linear complexity of Hall's sextic residue sequences over \(\mathrm{GF}(q)\)
- On cyclotomic generator of order \(r\).
- Linear complexity of generalized cyclotomic sequences of order 4 over \(\mathbb{F}_l\)
- Linear complexity of generalized cyclotomic sequences with period \(2^mp^n\)
- Linear complexity and related complexity measures
- On the \(k\)-error linear complexity of binary sequences derived from the discrete logarithm in finite fields
- A linear complexity analysis of quadratic residues and primitive roots spacings
- Determination of the merit factor of Legendre sequences
- Autocorrelation and linear complexity of binary generalized cyclotomic sequences with period \(pq\)
- Remarks on the generalized cyclotomic sequences of length \(2p^m\)
- Linear complexity of ternary sequences formed on the basis of power residue classes
- Trace representation of Legendre sequences
- Linear complexity over \(\mathbb{F}_q\) and 2-adic complexity of a class of binary generalized cyclotomic sequences with good autocorrelation
- Linear complexity of binary cyclotomic sequences of order 6
- The linear complexity of a class of binary sequences with period \(2p\)
- A further study of the linear complexity of new binary cyclotomic sequence of length \(p^r\)
- On the linear complexities of two classes of quaternary sequences of even length with optimal autocorrelation
- A kind of quaternary sequences of period \(2 p^m q^n\) and their linear complexity
- Linear complexity of a new class of quaternary generalized cyclotomic sequence with period \(2 p^m\)
- On the arithmetic autocorrelation of the Legendre sequence
- On the linear complexity of Ding-Helleseth generalized cyclotomic binary sequences of order four and six
- The Linear Generation of the Legendre Sequence
- Trace representation of Legendre sequences over non-binary fields
- Some uncertain generalized Shapley aggregation operators for multi-attribute group decision making
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4400352)
