Name
Abstract | ||
|---|---|---|
We introduce a new type of sequences using the sum of coefficients of characteristic polynomials for elements (in particular, primitive elements) in a finite field. These sequences are nonlinear filtering sequences of the well-known -sequences. We show that they have large linear complexity and large period. We also provide some examples of such binary sequences with good autocorrelation values. |
Year | DOI | Venue |
|---|---|---|
2018 | https://doi.org/10.1007/s12095-017-0256-3 | Cryptography and Communications |
Keywords | DocType | Volume |
Nonlinearly filtered LFSR sequences,Linear complexity,Maximum period,Correlation,94A55 | Journal | 10 |
Issue | ISSN | Citations |
4 | 1936-2447 | 0 |
PageRank | References | Authors |
0.34 | 0 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Aleksandr Tuxanidy | 1 | 13 | 1.83 |
| Qiang Wang | 2 | 237 | 37.93 |