Counting irreducible polynomials over GF(3) with first and third coefficients given

DOI10.1142/S1793557115500151zbMath1333.11113OpenAlexW2093502528MaRDI QIDQ5247080

Saroj Sharma, Prem L. Sharma, Mansi Rehan

Publication date: 22 April 2015

Published in: Asian-European Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793557115500151

zbMATH Keywords

finite fieldtraceMöbius inversionirreducible polynomial

Mathematics Subject Classification ID

Polynomials in general fields (irreducibility, etc.) (12E05) Polynomials over finite fields (11T06)

Related Items

A class of Gaussian normal bases and their dual bases ⋮ On the enumeration of irreducible polynomials over \(\mathrm{GF}(q)\) with prescribed coefficients

Cites Work

• Unnamed Item
• Elliptic curves and explicit enumeration of irreducible polynomials with two coefficients pre\-scribed
• The number of irreducible polynomials of degree \(n\) over \(\mathbb F_q\) with given trace and constant terms
• Irreducible polynomials over \(\mathrm{GF}(2)\) with three prescribed coefficients.
• Irreducible polynomials over GF(2) with prescribed coefficients.
• Fast decoding of non-binary first order Reed-Muller codes
• On the minimum distances of non-binary cyclic codes
• Irreducible polynomials over finite fields with prescribed trace/prescribed constant term
• The Number of Irreducible Polynomials and Lyndon Words with Given Trace
• Handbook of Finite Fields
• Key Length Estimation of Pairing-Based Cryptosystems Using η T Pairing
• Kloosterman sums, elliptic curves, and irreducible polynomials with prescribed trace and norm
• Weight Formulas for Ternary Melas Codes