Constructing irreducible polynomials over finite fields
We describe a new method for constructing irreducible polynomials modulo a prime number p. The method mainly relies on Chebotarev's density theorem.
Saved in:
Main Authors: | Ling, San, Ozdemir, Enver, Xing, Chaoping |
---|---|
Other Authors: | School of Physical and Mathematical Sciences |
Format: | Article |
Language: | English |
Published: |
2013
|
Online Access: | https://hdl.handle.net/10356/97307 http://hdl.handle.net/10220/10582 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
An upper bound on the complexity of multiplication of polynomials modulo a power of an irreducible polynomial
by: Kaminski, Michael, et al.
Published: (2013) -
Construction of de Bruijn sequences from product of two irreducible polynomials
by: Chang, Zuling, et al.
Published: (2017) -
On self-dual cyclic codes over finite fields
by: Jia, Yan, et al.
Published: (2012) -
The cycle structure of LFSR with arbitrary characteristic polynomial over finite fields
by: Chang, Zuling, et al.
Published: (2019) -
A relation between embedding degrees and class numbers of binary quadratic forms
by: Ling, San, et al.
Published: (2015)