On cyclotomic generator of order r.
From MaRDI portal
Publication:2583534
DOI10.1016/S0020-0190(98)00025-8zbMATH Open1078.94511OpenAlexW2003125393MaRDI QIDQ2583534FDOQ2583534
Authors: Cunsheng Ding, Tor Helleseth 
Publication date: 17 January 2006
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0020-0190(98)00025-8
Recommendations
- scientific article; zbMATH DE number 2124947
- Linear complexity of generalized cyclotomic sequences of order 4 over \(\mathbb{F}_l\)
- scientific article; zbMATH DE number 1455086
- ON THE LINEAR COMPLEXITY OF SOME GENERALIZED CYCLOTOMIC SEQUENCES
- Linear Complexity of New Generalized Cyclotomic Sequences of Order Two of Length<tex>$pq$</tex>
Cites Work
- The stability theory of stream ciphers
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Cyclotomy, Higher Congruences, and Waring's Problem II
- Binary pulse compression codes
- De Bruijn sequences, irreducible codes and cyclotomy
- Design of Sequences with Specified Autocorrelation and Cross Correlation
Cited In (9)
- Linear complexity of Ding-Helleseth sequences of order 2 over \(\mathrm{GF}(l)\)
- Sequences related to Legendre/Jacobi sequences
- Polynomial representations of the Lucas logarithm
- Remarks on a cyclotomic sequence
- Some notes on the linear complexity of Sidel'nikov-Lempel-Cohn-Eastman sequences
- Linear complexity of generalized cyclotomic sequences of order 4 over \(\mathbb{F}_l\)
- A kind of quaternary sequences of period \(2 p^m q^n\) and their linear complexity
- On the k-error linear complexity of cyclotomic sequences
- Linear complexity and trace representation of quaternary sequences over \(\mathbb {Z}_{4}\) based on generalized cyclotomic classes modulo \( pq\)
This page was built for publication: On cyclotomic generator of order \(r\).
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2583534)
