Institutional Repository
| Groups of Permutation Polynomials over Finite Fields | |
| Richard M. Stafford | |
| 1998 | |
| Source | Finite Fields and Their Applications
 |
| Volume | 4Issue:4Pages:450-452 |
| English Abstract | LetFbe a finite field. We apply a result of Thierry Berger (1996,Designs Codes Cryptography,7, 215–221) to determine the structure of all groups of permutations onFgenerated by the permutations induced by the linear polynomials and any power map which induces a permutation onF. This generalizes a result of Leonard Carlitz (1953,Proc. Amer. Math. Soc.,4, 538). |
| Indexed Type | 其他 |
| Cooperation Status | 其它 |
| Language | 英语 |
| Content Type | 期刊论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/1332 |
| Collection | 中国科学院软件研究所 |
| Recommended Citation GB/T 7714 | Richard M. Stafford. Groups of Permutation Polynomials over Finite Fields[J]. Finite Fields and Their Applications,1998,4(4):450-452. |
| APA | Richard M. Stafford.(1998).Groups of Permutation Polynomials over Finite Fields.Finite Fields and Their Applications,4(4),450-452. |
| MLA | Richard M. Stafford."Groups of Permutation Polynomials over Finite Fields".Finite Fields and Their Applications 4.4(1998):450-452. |
| Files in This Item: | ||||||
| File Name/Size | DocType | Version | Access | License | ||
| BJ01137416.pdf（194KB） | 开放获取 | License | Application Full Text | |||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment