Counting polynomials with distinct zeros in finite fields
From MaRDI portal
Publication:503699
DOI10.1016/j.jnt.2016.10.008zbMath1387.11092arXiv1702.02327OpenAlexW2559135948MaRDI QIDQ503699
Weiqiong Wang, Li-Ping Wang, Haiyan Zhou
Publication date: 23 January 2017
Published in: Journal of Number Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1702.02327
polynomialsquadratic formsReed-Solomon codesspectrum of graphsinclusion-exclusion principlemoments subset-sumWenger graphs
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Polynomials over finite fields (11T06) Cyclic codes (94B15)
Related Items (2)
On the enumeration of polynomials with prescribed factorization pattern ⋮ Counting polynomials over finite fields with prescribed leading coefficients and linear factors
Cites Work
- Unnamed Item
- Unnamed Item
- Deep holes in Reed-Solomon codes based on Dickson polynomials
- On the error distance of extended Reed-Solomon codes
- On the spectrum of Wenger graphs
- A new sieve for distinct coordinate counting
- On the subset sum problem over finite fields
- On the diameter of Wenger graphs
- On error distance of Reed-Solomon codes
- Extremal graphs with no \(C^{4,}\)s, \(C^{6,}\)s, or \(C^{10,}\)s
- New examples of graphs without small cycles and of large size
- Explicit construction of graphs with an arbitrary large girth and of large size
- Linearized Wenger graphs
- Computing Error Distance of Reed-Solomon Codes
- A Deterministic Reduction for the Gap Minimum Distance Problem
- Counting polynomials with a given number of zeros in a finite field
- An infinite series of regular edge- but not vertex-transitive graphs
- Complexity of Decoding Positive-Rate Primitive Reed–Solomon Codes
This page was built for publication: Counting polynomials with distinct zeros in finite fields
