The linear complexity of new generalized cyclotomic binary sequences of order four
From MaRDI portal
Publication:2466080
DOI10.1016/j.ins.2007.09.012zbMath1134.94355OpenAlexW1999540821MaRDI QIDQ2466080
Li Hong, Tongjiang Yan, Guozhen Xiao
Publication date: 11 January 2008
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2007.09.012
Related Items (6)
Linear complexity and autocorrelation values of a polyphase generalized cyclotomic sequence of length \(pq\) ⋮ A new class of quaternary generalized cyclotomic sequences of order 2d and length 2pm with high linear complexity ⋮ Linear complexity and trace representation of quaternary sequences over \(\mathbb {Z}_{4}\) based on generalized cyclotomic classes modulo \( pq\) ⋮ Linear complexity of binary Whiteman generalized cyclotomic sequences of order \(2^k\) ⋮ Linear complexity of Ding-Helleseth generalized cyclotomic sequences of order eight ⋮ Linear complexity of quaternary sequences of length \(pq\) with low autocorrelation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finding an internal state of RC4 stream cipher
- Linear complexity of generalized cyclotomic binary sequences of order 2
- New generalized cyclotomy and its applications
- Theory of transformation groups of polynomials over \(\mathrm{GF}(2)\) with applications to linear shift register sequences
- Optimum OVSF code reassignment in wideband CDMA forward radio link
- A Survey of Difference Sets
- Linear Complexity of New Generalized Cyclotomic Sequences of Order Two of Length<tex>$pq$</tex>
- On the linear complexity of Hall's sextic residue sequences
- Autocorrelation values of generalized cyclotomic sequences of order two
- Generalized cyclotomic codes of length p/sub 1//sup e(1)/...p/sub t//sup e(t)/
This page was built for publication: The linear complexity of new generalized cyclotomic binary sequences of order four
