ON THE LINEAR COMPLEXITY OF SOME GENERALIZED CYCLOTOMIC SEQUENCES
From MaRDI portal
Publication:4824697
DOI10.1142/S0218196704001827zbMATH Open1060.94012MaRDI QIDQ4824697FDOQ4824697
Authors: Young-Ho Park, Deukjo Hong, Hichun Eun 
Publication date: 1 November 2004
Published in: International Journal of Algebra and Computation (Search for Journal in Brave)
Recommendations
- Linear Complexity of Some Generalized Cyclotomic Sequences
- Linear complexity of generalized cyclotomic sequences of order 4 over \(\mathbb{F}_l\)
- Linear complexity of generalized cyclotomic binary sequences of order 2
- The linear complexity of generalized cyclotomic binary sequences of period \(p^n\)
- Linear complexity of generalized cyclotomic binary sequences of length \(2p^{m}\)
Cryptography (94A60) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cyclotomy (11T22)
Cites Work
Cited In (10)
- Cryptographic properties of some binary generalized cyclotomic sequences with the length \(p^{2}\)
- Title not available (Why is that?)
- On the linear complexity of the Naor-Reingold sequence with elliptic curves
- Linear Complexity and Autocorrelation of Prime Cube Sequences
- About computation of the linear complexity of generalized cyclotomic sequences with period \(p^{n+1}\)
- On cyclotomic generator of order \(r\).
- Linear complexity of generalized cyclotomic sequences of period \(2p^m\)
- New classes of asymptotically optimal spectrally-constrained sequences derived from cyclotomy
- On the 2-adic complexity of cyclotomic binary sequences of order three
- On the k-error linear complexity of cyclotomic sequences
This page was built for publication: ON THE LINEAR COMPLEXITY OF SOME GENERALIZED CYCLOTOMIC SEQUENCES
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4824697)
