Trace representation of some generalized cyclotomic sequences of length \(pq\)
From MaRDI portal
Publication:942315
DOI10.1016/j.ins.2007.11.023zbMath1234.94021OpenAlexW1999159929MaRDI QIDQ942315
Tongjiang Yan, Xiaoni Du, Guozhen Xiao
Publication date: 5 September 2008
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2007.11.023
finite fieldlinear complexitytrace functionbinary sequencegeneralized cyclotomic sequencedefining pair
Analysis of algorithms and problem complexity (68Q25) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)
Related Items
Trace representation and linear complexity of binary sequences derived from Fermat quotients, Linear complexity and autocorrelation values of a polyphase generalized cyclotomic sequence of length \(pq\), A new class of quaternary generalized cyclotomic sequences of order 2d and length 2pm with high linear complexity, Linear complexity and trace representation of quaternary sequences over \(\mathbb {Z}_{4}\) based on generalized cyclotomic classes modulo \( pq\)
Cites Work
- A trace representation of binary Jacobi sequences
- Linear complexity of generalized cyclotomic binary sequences of order 2
- New generalized cyclotomy and its applications
- Sequences related to Legendre/Jacobi sequences
- Theory of transformation groups of polynomials over \(\mathrm{GF}(2)\) with applications to linear shift register sequences
- Optimum OVSF code reassignment in wideband CDMA forward radio link
- Linear Complexity of New Generalized Cyclotomic Sequences of Order Two of Length<tex>$pq$</tex>
- A Simple Unpredictable Pseudo-Random Number Generator
- An analysis of the structure and complexity of nonlinear binary sequence generators
- A family of difference sets
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
