Name
Abstract | ||
|---|---|---|
It is shown that the linear complexity for one-symbol substitution of any periodic sequence over GF(q) can be computed without any condition on the minimal polynomial of the sequence |
Year | DOI | Venue |
|---|---|---|
1998 | 10.1109/18.669427 | IEEE Transactions on Information Theory |
Keywords | Field | DocType |
sequences,indexing terms,periodic sequence,polynomials,information security,computational complexity,computer science,information theory,minimal polynomial,mathematics | Complexity class,PH,Discrete mathematics,Average-case complexity,Combinatorics,Structural complexity theory,Primitive polynomial,Minimal polynomial (linear algebra),Periodic sequence,Mathematics,Computational complexity theory | Journal |
Volume | Issue | ISSN |
44 | 3 | 0018-9448 |
Citations | PageRank | References |
9 | 1.47 | 1 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zong-duo Dai | 1 | 203 | 25.53 |
| Kyoki Imamura | 2 | 57 | 7.98 |