Linear complexity of generalized cyclotomic binary sequences of order 2
From MaRDI portal
Publication:1266420
DOI10.1006/FFTA.1997.0181zbMath0908.11062OpenAlexW1970347307MaRDI QIDQ1266420
Publication date: 18 March 1999
Published in: Finite Fields and their Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/ffta.1997.0181
Analysis of algorithms and problem complexity (68Q25) Number-theoretic algorithms; complexity (11Y16) Random number generation in numerical analysis (65C10) Cyclotomy (11T22)
Related Items (47)
Unnamed Item ⋮ Linear complexity of Ding-Helleseth sequences of order 2 over \(\mathrm{GF}(l)\) ⋮ On finite length nonbinary sequences with large nonlinear complexity over the residue ring \(\mathbb{Z}_m\) ⋮ On the k-error linear complexity of binary sequences derived from polynomial quotients ⋮ Generalized cyclotomic numbers of order two and their applications ⋮ Cyclic codes from the first class two-prime Whiteman's generalized cyclotomic sequence with order 6 ⋮ Sequences related to Legendre/Jacobi sequences ⋮ New generalized cyclotomic binary sequences of period \(p^2\) ⋮ A new frequency-hopping sequence set based upon generalized cyclotomy ⋮ ON THE LINEAR COMPLEXITY OF SOME GENERALIZED CYCLOTOMIC SEQUENCES ⋮ 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\) ⋮ On the linear complexity of Hall's sextic residue sequences over \(\mathrm{GF}(q)\) ⋮ Remarks on the generalized cyclotomic sequences of length \(2p^m\) ⋮ New classes of asymptotically optimal spectrally-constrained sequences derived from cyclotomy ⋮ On the linear complexity and autocorrelation of generalized cyclotomic binary sequences with period \(4p^n \) ⋮ 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 ⋮ About the linear complexity of quaternary sequences with even length ⋮ Pseudo-randomness of certain sequences of \(k\) symbols with length \(pq\) ⋮ 2-Adic Complexity of Two Classes of Generalized Cyclotomic Binary Sequences ⋮ Permutation polynomials over finite fields from a powerful lemma ⋮ Linear complexity of cyclotomic sequences of order six and BCH codes over \(\mathrm{GF}(3)\) ⋮ Cyclic codes via the general two-prime generalized cyclotomic sequence of order two ⋮ Trace representation of some generalized cyclotomic sequences of length \(pq\) ⋮ The linear complexity of new generalized cyclotomic binary sequences of order four ⋮ Linear complexity and trace representation of quaternary sequences over \(\mathbb {Z}_{4}\) based on generalized cyclotomic classes modulo \( pq\) ⋮ Cyclic codes from the second class two-prime Whiteman's generalized cyclotomic sequence with order 6 ⋮ Cryptographic properties of some binary generalized cyclotomic sequences with the length \(p^{2}\) ⋮ Linear complexity of generalized cyclotomic binary sequences of length \(2p^{m}\) ⋮ On the linear complexity of Legendre-Sidelnikov sequences ⋮ Linear complexity problem of binary Jacobi sequence ⋮ Some notes on the linear complexity of Sidel'nikov-Lempel-Cohn-Eastman sequences ⋮ New \(M\)-ary sequences with low autocorrelation from interleaved technique ⋮ Large families of pseudo-random subsets formed by generalized cyclotomic classes ⋮ On the properties of generalized cyclotomic binary sequences of period \(2p^m\) ⋮ Autocorrelation and linear complexity of binary generalized cyclotomic sequences with period \(pq\) ⋮ Linear complexity of a class of pseudorandom sequences over a general finite field ⋮ Linear complexity of binary Whiteman generalized cyclotomic sequences of order \(2^k\) ⋮ Remarks on a cyclotomic sequence ⋮ Linear complexity and correlation of a class of binary cyclotomic sequences ⋮ A trace representation of binary Jacobi sequences ⋮ Binary sequences with period \(N\) and nonlinear complexity \(N - 2\) ⋮ Linear complexity of Ding-Helleseth generalized cyclotomic sequences of order eight ⋮ Linear complexity of generalized cyclotomic sequences of period \(2p^m\) ⋮ Additive character sums of polynomial quotients ⋮ Linear complexity of quaternary sequences of length \(pq\) with low autocorrelation
Cites Work
- A combinatorial approach to probabilistic results on the linear- complexity profile of random sequences
- The stability theory of stream ciphers
- Cyclic difference sets
- Keystream Sequences with a Good Linear Complexity Profile for Every Starting Point
- A Simple Unpredictable Pseudo-Random Number Generator
- Linear Complexity and Random Sequences
- A software-optimized encryption algorithm
- A family of difference sets
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Linear complexity of generalized cyclotomic binary sequences of order 2
