Name
Abstract | ||
|---|---|---|
Minimal polynomials and linear complexity of binary Ding-Hellseth generalized cyclotomic sequences of order 2 of length pq are obtained by Bai in 2005. In this correspondence, we obtain linear complexity of mu-ary Ding-Helleseth generalized cyclotomic sequences of any order. Our results show that these sequences also have high linear complexity. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1109/INCoS.2013.120 | INCoS |
Keywords | Field | DocType |
polyphase generalized cyclotomic sequences,minimal polynomials,polyphase generalized sequence,linear complexity,cyclotomic sequence,binary ding-hell seth,stream cipher,high linear complexity,length pq,new polyphase generalized sequence,computational complexity,mu-ary ding-helleseth,minimal polynomial,binary ding-hellseth generalized cyclotomic sequences,polynomials | Discrete mathematics,Polyphase system,Polynomial,Computer science,Stream cipher,Linear complexity,Binary number,Distributed computing,Computational complexity theory | Conference |
Citations | PageRank | References |
0 | 0.34 | 3 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tongjiang Yan | 1 | 8 | 4.07 |
| Pan Xu | 2 | 0 | 1.69 |