Linear complexity of generalized cyclotomic binary sequences of order 2
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3882549 (Why is no real title available?)
- scientific article; zbMATH DE number 4062985 (Why is no real title available?)
- scientific article; zbMATH DE number 177032 (Why is no real title available?)
- scientific article; zbMATH DE number 1122449 (Why is no real title available?)
- scientific article; zbMATH DE number 1455086 (Why is no real title available?)
- scientific article; zbMATH DE number 1498327 (Why is no real title available?)
- scientific article; zbMATH DE number 854547 (Why is no real title available?)
- scientific article; zbMATH DE number 3221502 (Why is no real title available?)
- scientific article; zbMATH DE number 3252237 (Why is no real title available?)
- A Simple Unpredictable Pseudo-Random Number Generator
- A combinatorial approach to probabilistic results on the linear- complexity profile of random sequences
- A family of difference sets
- A software-optimized encryption algorithm
- Cyclic difference sets
- Keystream Sequences with a Good Linear Complexity Profile for Every Starting Point
- Linear Complexity and Random Sequences
- The stability theory of stream ciphers
Cited in
(53)- On finite length nonbinary sequences with large nonlinear complexity over the residue ring \(\mathbb{Z}_m\)
- The linear complexity of related prime sequences
- A trace representation of binary Jacobi sequences
- Cyclic codes via the general two-prime generalized cyclotomic sequence of order two
- Linear complexity of Ding-Helleseth generalized cyclotomic sequences of order eight
- Linear complexity of two classes of quaternary sequences based on sign alternation transformation
- Linear complexity of Ding-Helleseth sequences of order 2 over \(\mathrm{GF}(l)\)
- Cryptographic properties of some binary generalized cyclotomic sequences with the length \(p^{2}\)
- 2-adic complexity of two classes of generalized cyclotomic binary sequences
- Sequences related to Legendre/Jacobi sequences
- The linear complexity of new generalized cyclotomic binary sequences of order four
- 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
- 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\)
- A new frequency-hopping sequence set based upon generalized cyclotomy
- Generalized cyclotomic numbers of order two and their applications
- Large families of pseudo-random subsets formed by generalized cyclotomic classes
- Some Notes on the Two-Prime Generator of Order<tex>$2$</tex>
- On the k-error linear complexity of binary sequences derived from polynomial quotients
- New \(M\)-ary sequences with low autocorrelation from interleaved technique
- On the properties of generalized cyclotomic binary sequences of period \(2p^m\)
- Linear complexity of generalized cyclotomic binary sequences of length \(2p^{m}\)
- Linear complexity and correlation of a class of binary cyclotomic sequences
- Linear complexity of generalized cyclotomic sequences with period \(p^nq^m\)
- Remarks on a cyclotomic sequence
- On the linear complexity and autocorrelation of generalized cyclotomic binary sequences with period \(4p^n \)
- Cyclic codes from the first class two-prime Whiteman's generalized cyclotomic sequence with order 6
- Linear complexity of a class of pseudorandom sequences over a general finite field
- ON THE LINEAR COMPLEXITY OF SOME GENERALIZED CYCLOTOMIC SEQUENCES
- Linear complexity of cyclotomic sequences of order six and BCH codes over \(\mathrm{GF}(3)\)
- Some notes on the linear complexity of Sidel'nikov-Lempel-Cohn-Eastman sequences
- On the linear complexity of Hall's sextic residue sequences over \(\mathrm{GF}(q)\)
- Linear complexity and autocorrelation values of a polyphase generalized cyclotomic sequence of length pq
- Linear complexity of generalized cyclotomic sequences of order 4 over \(\mathbb{F}_l\)
- Cyclic codes from the second class two-prime Whiteman's generalized cyclotomic sequence with order 6
- The linear complexity problem of a binary Jacobi sequence
- Remarks on the generalized cyclotomic sequences of length \(2p^m\)
- Autocorrelation and linear complexity of binary generalized cyclotomic sequences with period \(pq\)
- Linear complexity of generalized cyclotomic sequences of period \(2p^m\)
- Linear complexity of binary Whiteman generalized cyclotomic sequences of order 2ᵏ
- Linear complexity of binary cyclotomic sequences of order 6
- Trace representation of some generalized cyclotomic sequences of length pq
- Additive character sums of polynomial quotients
- Linear complexity of generalized cyclotomic binary sequences of order \(2d\) and length \(2p^m\)
- New classes of asymptotically optimal spectrally-constrained sequences derived from cyclotomy
- Linear complexity and trace representation of quaternary sequences over \(\mathbb {Z}_{4}\) based on generalized cyclotomic classes modulo \( pq\)
- Pseudo-randomness of certain sequences of k symbols with length pq
- On the linear complexity of Ding-Helleseth generalized cyclotomic binary sequences of order four and six
This page was built for publication: Linear complexity of generalized cyclotomic binary sequences of order 2
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1266420)
