Linear complexity of a class of pseudorandom sequences over a general finite field
From MaRDI portal
Publication:1800251
DOI10.1007/S00500-017-2870-6zbMath1398.94088OpenAlexW2762034895MaRDI QIDQ1800251
Publication date: 23 October 2018
Published in: Soft Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00500-017-2870-6
Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear complexity of Ding-Helleseth sequences of order 2 over \(\mathrm{GF}(l)\)
- Linear complexity of binary generalized cyclotomic sequences over \(\mathrm{GF}(q)\)
- Linear complexity of generalized cyclotomic binary sequences of order 2
- New generalized cyclotomy and its applications
- The vulnerability of geometric sequences based on fields of odd characteristic
- Cyclic codes from cyclotomic sequences of order four
- Two-Factor Data Security Protection Mechanism for Cloud Storage System
- Linear Complexity of New Generalized Cyclotomic Sequences of Order Two of Length<tex>$pq$</tex>
- On the linear complexity of Hall's sextic residue sequences
- Autocorrelation values of generalized cyclotomic sequences of order two
- Cyclic Codes From the Two-Prime Sequences
- On the k-error linear complexity of cyclotomic sequences
- A family of difference sets
This page was built for publication: Linear complexity of a class of pseudorandom sequences over a general finite field
