Characterization and enumeration of good punctured polynomials over finite fields

DOI10.1155/2016/6093219MaRDI QIDQ1751477zbMATH OpenOpenAlexWikidataFDO

Authors Somphong Jitman, Supanut Meesawat, Arithat Thanakulitthirat, Napat Thumwanit, Aunyarat Bunyawat

Publication date 25 May 2018

Published in International Journal of Mathematics and Mathematical Sciences (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1155/2016/6093219

zbMATH Keywords

good punctured polynomials

Mathematics Subject Classification ID

Polynomials over finite fields (11T06)

Review text

Summary: A family of good punctured polynomials is introduced. The complete characterization and enumeration of such polynomials are given over the binary field \(\mathbb{F}_2\). Over a nonbinary finite field \(\mathbb{F}_q\), the set of good punctured polynomials of degree less than or equal to \(2\) are completely determined. For \(n \geq 3\), constructive lower bounds of the number of good punctured polynomials of degree \(n\) over \(\mathbb{F}_q\) are given.

Recommendations

• Enumeration of special sets of polynomials over finite fields
• On counting polynomials over finite fields
• Polynomial multiplicities over finite fields and intersection sets
• scientific article; zbMATH DE number 7622932
• scientific article; zbMATH DE number 3363691
• Polynomials over finite fields: an index approach
• A characterization of primitive polynomials over finite fields.
• On some properties of polynomials over finite fields
• Factorization of polynomials over finite fields and characteristic sequences
• Character sums and deterministic polynomial root finding in finite fields

Cites work

• Counting polynomials with a given number of zeros in a finite field
• Fast construction of irreducible polynomials over finite fields
• Hermitian self-orthogonal constacyclic codes over finite fields
• scientific article; zbMATH DE number 6003858 (Why is no real title available?)
• scientific article; zbMATH DE number 3265895 (Why is no real title available?)
• Hulls of cyclic and negacyclic codes over finite fields
• Introduction to abstract algebra.
• New progress in real and complex polynomial root-finding
• On permutation polynomials over finite fields
• On some permutation polynomials over finite fields
• ON THE REDUCTIBILITY OF POLYNOMIALS OVER A FINITE FIELD
• Polynomial root-finding and polynomiography

This page was built for publication: Characterization and enumeration of good punctured polynomials over finite fields

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1751477)