Enumerating all the Irreducible Polynomials over Finite Field

Abstract

In this paper we give a detailed analysis of deterministic and randomized algorithms that enumerate any number of irreducible polynomials of degree $n$ over a finite field and their roots in the extension field in quasilinear where $N=n^2$ is the size of the output.} time cost per element. Our algorithm is based on an improved algorithm for enumerating all the Lyndon words of length $n$ in linear delay time and the known reduction of Lyndon words to irreducible polynomials.

References in corpus (3)

• Ranking and unranking trees with a given number or a given set of leaves
• Dense Testers: Almost Linear Time and Locally Explicit Constructions
• Ranking and Unranking of Hereditarily Finite Functions and Permutations