Generators and irreducible polynomials over finite fields

From MaRDI portal
Publication:4340866

DOI10.1090/S0025-5718-97-00835-1zbMath0879.11072OpenAlexW2050777560MaRDI QIDQ4340866

Daqing Wan

Publication date: 15 June 1997

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0025-5718-97-00835-1




Related Items

Character sums, primitive elements, and powers in finite fieldsOn the existence for some special primitive elements in finite fieldsDecompositions of matrices into diagonalizable and square-zero matricesAveraging operators over homogeneous varieties over finite fieldsExplicit equivalence of quadratic forms over \(\mathbb{F}_q(t)\)On the existence of primitive normal elements of rational form over finite fields of even characteristicThe existence of primitive normal elements of quadratic forms over finite fieldsJoint distribution in residue classes of polynomial-like multiplicative functionsON THE PRODUCT OF ELEMENTS WITH PRESCRIBED TRACEFactor base discrete logarithms in Kummer extensionsOn the squares in the set of elements of a finite field with constraints on the coefficients of its basis expansionPrescribing coefficients of invariant irreducible polynomialsEnumeration of self-reciprocal irreducible monic polynomials with prescribed leading coefficients over a finite fieldGenerating sets for the multiplicative groups of algebras over finite fields and expander graphsPrimitive idempotents in central simple algebras over \(\mathbb{F}_q(t)\) with an application to coding theoryUnicyclic strong permutationsAlgebraic Cayley graphs over finite fieldsPair of primitive normal elements of rational form over finite fields of characteristic 2On the number of \(N\)-free elements with prescribed traceA new sieve for distinct coordinate countingThe arithmetic of consecutive polynomial sequences over finite fieldsA new perspective on the powers of two descent for discrete logarithms in finite fieldsA POLYNOMIAL ANALOGUE OF LANDAU'S THEOREM AND RELATED PROBLEMSNew estimates and existence results about irreducible polynomials and self-reciprocal irreducible polynomials with prescribed coefficients over a finite fieldNew optimal optical orthogonal codes by restrictions to subgroupsSelf-reciprocal irreducible polynomials with prescribed coefficientsOn Reed-Solomon codesDistribution \(\bmod{p}\) of Euler's totient and the sum of proper divisorsOn the discrete logarithm problem in finite fields of fixed characteristicOn the existence of some specific elements in finite fields of characteristic 2On the Hansen-Mullen conjecture for self-reciprocal irreducible polynomialsOn primitive normal elements over finite fieldsCounting subset sums of finite Abelian groupsIrreducible polynomials over GF(2) with prescribed coefficients.Irreducible polynomials with several prescribed coefficientsOn coefficients of polynomials over finite fieldsUnnamed ItemA note on the Hansen-Mullen conjecture for self-reciprocal irreducible polynomialsRemarks on the distribution of the primitive roots of a primeIrreducible polynomials with consecutive zero coefficientsSquarefree polynomials with prescribed coefficientsIrreducible polynomials with several prescribed coefficientsOn enumeration of irreducible polynomials and related objects over a finite field with respect to their trace and normPartial zeta functions of algebraic varieties over finite fieldsThe number of irreducible polynomials of degree \(n\) over \(\mathbb F_q\) with given trace and constant termsPrimitive polynomials with a prescribed coefficientIndiscreet logarithms in finite fields of small characteristicA new proof of the Hansen-Mullen irreducibility conjectureFrobenius nonclassical components of curves with separated variablesShift-inequivalent decimations of the Sidelnikov-Lempel-Cohn-Eastman sequencesA generalization of the Hansen-Mullen conjecture on irreducible polynomials over finite fieldsО квадратах во множестве элементов конечного поля с ограничениями на коэффициенты при разложении по базисуOn error distance of Reed-Solomon codesExplicit theorems on generator polynomialsOn certain diagonal equations over finite fieldsCayley Graphs Generated by Small Degree Polynomials over Finite FieldsTraps to the BGJT-algorithm for discrete logarithms



Cites Work