arXiv · 1710.04270
Recursive construction of primitive polynomials over finite fields
Abstract
In this paper, a computationally simple and explicit method of constructing recursive sequence of primitive polynomials of degree $n2^k (k = 1, 2, 3,\ldots)$ over $\mathbb{F}_{q}$ is given.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Mahmood Alizadeh. 2019-07-24. Recursive construction of primitive polynomials over finite fields. https://arxiv.org/abs/1710.04270
Cite the original work for its findings. Save a collection to share your selection of sources.