Linear Complexity and Autocorrelation of Prime Cube Sequences
From MaRDI portal
Publication:5386094
DOI10.1007/978-3-540-77224-8_23zbMath1195.11162OpenAlexW1501721930MaRDI QIDQ5386094
Seok-Yong Jin, Hong-Yeop Song, Young Joon Kim
Publication date: 17 April 2008
Published in: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-77224-8_23
Related Items (8)
New generalized cyclotomic binary sequences of period \(p^2\) ⋮ Remarks on the generalized cyclotomic sequences of length \(2p^m\) ⋮ On the linear complexity and autocorrelation of generalized cyclotomic binary sequences with period \(4p^n \) ⋮ 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 of generalized cyclotomic binary sequences of length \(2p^{m}\) ⋮ Linear complexity of generalized cyclotomic sequences of period \(2p^m\)
Cites Work
- Unnamed Item
- Unnamed Item
- New generalized cyclotomy and its applications
- Linear Complexity of New Generalized Cyclotomic Sequences of Order Two of Length<tex>$pq$</tex>
- Linear Complexity of Some Generalized Cyclotomic Sequences
- ON THE LINEAR COMPLEXITY OF SOME GENERALIZED CYCLOTOMIC SEQUENCES
This page was built for publication: Linear Complexity and Autocorrelation of Prime Cube Sequences
