Pages that link to "Item:Q3073516"

The following pages link to Counting irreducible polynomials over finite fields (Q3073516):

Displaying 16 items.

• Counting irreducible polynomials of degree \(r\) over \(\mathbb F_{q^n}\) and generating Goppa codes using the lattice of subfields of \(\mathbb F_{q^{nr}}\) (Q470971) (← links)
• An uncertainty principle for function fields (Q538160) (← links)
• Revisiting Gauss's analogue of the prime number theorem for polynomials over a finite field (Q982485) (← links)
• On irreducibles in the polynomial semigroup (Q996723) (← links)
• Counting irreducible factors of polynomials over a finite field (Q1210556) (← links)
• Applications of the large sieve inequality for \(\mathbb{F}_q[T]\) (Q1273729) (← links)
• Irreducible polynomials over finite fields. I (Q1892822) (← links)
• On irreducible polynomials of small height over finite fields (Q1925009) (← links)
• The estimated number of irreducible binomials (Q2197989) (← links)
• Counting Irreducible Polynomials over Finite Fields Using the Inclusion-Exclusion Principle (Q2911530) (← links)
• Properties of a Family of Cryptographic Boolean Functions (Q2945065) (← links)
• Théorèmes de densité dans $F_q[X]$ (Q3695361) (← links)
• On the number of irreducible polynomials in<i>F</i>_<i>q</i>[<i>x</i>] of special form (Q3728100) (← links)
• Résidus quadratiques dans F_q[T] (Q4548876) (← links)
• An analog of the prime number theorem for finite fields via truncated polylogarithm expansions (Q4600713) (← links)
• Some notes on Dirichlet's theorem on primes in arithmetic progressions (Q5017278) (← links)