Number of primitive elements of field extension GF(pnm)/GF(pn)

2001哈尔滨工业大学学报：英文版Computer Science被引 0

摘要

Presents the counting of the counts number of primitive elementsof finite dimensional field extension GF(pnm)/GF(pn) using (1) the principle of inclusion-exclusion, (2) the Mobius inversion, (3) the Euler O function, and the new identity obtained where, m＞1, p is a prime, O(.) is Euler function, and q1,…,qk are the all distinct prime divisors of m.

引用本文（GB/T 7714）

Yan, Zhibin. Number of primitive elements of field extension GF(pnm)/GF(pn)[J]. 哈尔滨工业大学学报：英文版, 2001.

引文网络

参考文献与被引分析加载中…

本站仅收录题录与摘要供学习参考，全文版权归属出版方；如有侵权请联系我们删除。