Name
Abstract | ||
|---|---|---|
For an odd prime p and a positive integer r, new classes of binary sequences with period p(r+1) are proposed from Euler quotients in this letter, which include several known classes of binary sequences derived from Fermat quotients and Euler quotients as special cases. The advantage of the new constructions is that they allow one to choose their support sets freely. Furthermore, with some constrains on the support set, the new sequences are proved to possess large linear complexities under the assumption of 2(p-1) not equivalent to 1 mod p(2). |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1587/transfun.E98.A.2199 | IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES |
Keywords | Field | DocType |
binary sequence, linear complexity, Fermat quotients, Euler quotients, balance | Discrete mathematics,Quotient,Pseudorandom binary sequence,Euler's formula,Fermat's Last Theorem,Linear complexity,Mathematics,Binary number,Pseudorandom number generator | Journal |
Volume | Issue | ISSN |
E98A | 10 | 0916-8508 |
Citations | PageRank | References |
1 | 0.37 | 7 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zhifan Ye | 1 | 5 | 1.81 |
| Pinhui Ke | 2 | 3 | 2.77 |
| Shengyuan Zhang | 3 | 82 | 7.38 |
| Zuling Chang | 4 | 3 | 1.76 |