Counting polynomials over finite fields with prescribed leading coefficients and linear factors

DOI10.1016/J.FFA.2022.102052MaRDI QIDQ2672340zbMATH OpenOpenAlexWikidataFDO

Authors Zhicheng Gao

Publication date 8 June 2022

Published in Finite Fields and their Applications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2105.12845

zbMATH Keywords

countingdistance distributionfinite fieldspolynomialsprescribed coefficientsReed-Solomon codes

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Exponential sums (11T23) Arithmetic theory of polynomial rings over finite fields (11T55) Linear codes (general theory) (94B05)

Abstract: We count the number of polynomials over finite fields with prescribed leading coefficients and a given number of linear factors. This is equivalent to counting codewords in Reed-Solomon codes which are at a certain distance from a received word. We first apply the generating function approach, which is recently developed by the author and collaborators, to derive expressions for the number of monic polynomials with prescribed leading coefficients and linear factors. We then apply Li and Wan's sieve formula to simplify the expressions in some special cases. Our results extend and improve some recent results by Li and Wan, and Zhou, Wang and Wang.

Recommendations

• On the enumeration of polynomials with prescribed factorization pattern
• Counting polynomials with distinct zeros in finite fields
• Counting irreducible polynomials with prescribed coefficients over a finite field
• On the number of factorizations of polynomials over finite fields
• scientific article; zbMATH DE number 1009707

Cites work

• Analytic combinatorics
• Bijections between compositions over finite groups
• Counting compositions over finite abelian groups
• Counting irreducible polynomials with prescribed coefficients over a finite field
• Counting polynomials with a given number of zeros in a finite field
• Counting polynomials with distinct zeros in finite fields
• Distance Distribution in Reed-Solomon Codes
• Generatingfunctionology
• scientific article; zbMATH DE number 50938 (Why is no real title available?)
• scientific article; zbMATH DE number 1432159 (Why is no real title available?)
• On Deciding Deep Holes of Reed-Solomon Codes
• On enumeration of irreducible polynomials and related objects over a finite field with respect to their trace and norm
• The Distribution of Irreducibles in GF [ q,x ]

Cited in

(3)

• Counting polynomials over finite fields with given root multiplicities
• Asymptotic distributions of the number of zeros of random polynomials in Hayes equivalence class over a finite field
• Counting polynomials with distinct roots using subset sum

This page was built for publication: Counting polynomials over finite fields with prescribed leading coefficients and linear factors

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