Linear Complexity and Autocorrelation of Prime Cube Sequences
From MaRDI portal
Recommendations
- On the linear complexity of a new generalized cyclotomic sequence with length \({p^3}\) over \({\text{GF}}\left( l \right)\)
- ON THE LINEAR COMPLEXITY OF SOME GENERALIZED CYCLOTOMIC SEQUENCES
- Linear complexity and correlation of a class of binary cyclotomic sequences
- The linear complexity of binary sequences of length 2p with optimal three-level autocorrelation
- Linear complexity and autocorrelation values of a polyphase generalized cyclotomic sequence of length pq
Cites work
- scientific article; zbMATH DE number 1194914 (Why is no real title available?)
- scientific article; zbMATH DE number 1196713 (Why is no real title available?)
- Linear Complexity of New Generalized Cyclotomic Sequences of Order Two of Length<tex>$pq$</tex>
- Linear Complexity of Some Generalized Cyclotomic Sequences
- New generalized cyclotomy and its applications
- ON THE LINEAR COMPLEXITY OF SOME GENERALIZED CYCLOTOMIC SEQUENCES
Cited in
(9)- New generalized cyclotomic binary sequences of period \(p^2\)
- Remarks on the generalized cyclotomic sequences of length 2p^m
- On the linear complexity and the autocorrelation of generalized cyclotomic binary sequences of length \(2p^m\)
- Linear complexity of generalized cyclotomic sequences of period \(2p^m\)
- On the autocorrelation and the linear complexity of q-ary prime n-square sequences
- New classes of quaternary cyclotomic sequence of length \(2p^m\) with high linear complexity
- On the linear complexity and autocorrelation of generalized cyclotomic binary sequences with period 4p^n
- About computation of the linear complexity of generalized cyclotomic sequences with period \(p^{n+1}\)
- Linear complexity of generalized cyclotomic binary sequences of length \(2p^{m}\)
This page was built for publication: Linear Complexity and Autocorrelation of Prime Cube Sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5386094)
