Abstract | ||
---|---|---|
We use cyclotomy to construct new classes of permutation polynomials over finite fields. This allows us to generate permutation polynomials in an algorithmic way and also to unify several previous constructions. Many permutation polynomials constructed in this way have large indices. |
Year | DOI | Venue |
---|---|---|
2013 | 10.1016/j.ffa.2013.02.005 | Finite Fields and Their Applications |
Keywords | Field | DocType |
11T06,12Y05 | Permutation graph,Discrete mathematics,Wilson polynomials,Combinatorics,Orthogonal polynomials,Algebra,Classical orthogonal polynomials,Discrete orthogonal polynomials,Cyclic permutation,Bit-reversal permutation,Generalized permutation matrix,Mathematics | Journal |
Volume | ISSN | Citations |
22 | 1071-5797 | 14 |
PageRank | References | Authors |
0.79 | 10 | 1 |
Name | Order | Citations | PageRank |
---|---|---|---|
Qiang Wang | 1 | 237 | 37.93 |