Subset sums of quadratic residues over finite fields
From MaRDI portal
Publication:346285
DOI10.1016/j.ffa.2016.09.003zbMath1351.11008arXiv1702.03028OpenAlexW2531006145MaRDI QIDQ346285
Weiqiong Wang, Li-Ping Wang, Haiyan Zhou
Publication date: 5 December 2016
Published in: Finite Fields and their Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1702.03028
Exact enumeration problems, generating functions (05A15) Other character sums and Gauss sums (11T24) Arithmetic combinatorics; higher degree uniformity (11B30)
Related Items (6)
Subset sums over Galois rings. II ⋮ Counting points on diagonal equations over Galois rings \(\mathrm{GR}(p^2,p^{2r})\) ⋮ The \(k\)-subset sum problem over finite fields ⋮ Subset sums over Galois rings ⋮ The \(k\)-subset sum problem over finite fields of characteristic 2 ⋮ Extensions of Schönemann's theorem in Galois rings
Cites Work
- A new sieve for distinct coordinate counting
- Counting subset sums of finite Abelian groups
- An asymptotic formula for counting subset sums over subgroups of finite fields
- On the subset sum problem over finite fields
- Linearized Wenger graphs
- Complexity of Decoding Positive-Rate Primitive Reed–Solomon Codes
- On Deciding Deep Holes of Reed-Solomon Codes
- On the List and Bounded Distance Decodability of Reed–Solomon Codes
This page was built for publication: Subset sums of quadratic residues over finite fields