Linear Complexity of Some Generalized Cyclotomic Sequences
From MaRDI portal
Publication:4704552
DOI10.1142/S021819679800020XzbMath0967.94006OpenAlexW2010201168MaRDI QIDQ4704552
Publication date: 26 April 2001
Published in: International Journal of Algebra and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s021819679800020x
Related Items (10)
New generalized cyclotomic binary sequences of period \(p^2\) ⋮ ON THE LINEAR COMPLEXITY OF SOME GENERALIZED CYCLOTOMIC SEQUENCES ⋮ On the linear complexity and the autocorrelation of generalized cyclotomic binary sequences of length \(2p^m\) ⋮ About computation of the linear complexity of generalized cyclotomic sequences with period \(p^{n+1}\) ⋮ New classes of quaternary cyclotomic sequence of length \(2p^m\) with high linear complexity ⋮ Linear Complexity and Autocorrelation of Prime Cube Sequences ⋮ Linear complexity of binary generalized cyclotomic sequences over \(\mathrm{GF}(q)\) ⋮ Cryptographic properties of some binary generalized cyclotomic sequences with the length \(p^{2}\) ⋮ Linear complexity of generalized cyclotomic binary sequences of length \(2p^{m}\) ⋮ Linear complexity of generalized cyclotomic binary sequences of order 2d and length 2pm
This page was built for publication: Linear Complexity of Some Generalized Cyclotomic Sequences