ON THE LINEAR COMPLEXITY OF SOME GENERALIZED CYCLOTOMIC SEQUENCES
From MaRDI portal
Publication:4824697
DOI10.1142/S0218196704001827zbMath1060.94012MaRDI QIDQ4824697
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)
Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60) Cyclotomy (11T22)
Related Items (4)
About computation of the linear complexity of generalized cyclotomic sequences with period \(p^{n+1}\) ⋮ Linear Complexity and Autocorrelation of Prime Cube Sequences ⋮ Cryptographic properties of some binary generalized cyclotomic sequences with the length \(p^{2}\) ⋮ Linear complexity of generalized cyclotomic sequences of period \(2p^m\)
Cites Work
This page was built for publication: ON THE LINEAR COMPLEXITY OF SOME GENERALIZED CYCLOTOMIC SEQUENCES