Subset sums of quadratic residues over finite fields
From MaRDI portal
Publication:346285
DOI10.1016/J.FFA.2016.09.003zbMATH Open1351.11008arXiv1702.03028OpenAlexW2531006145MaRDI QIDQ346285FDOQ346285
Authors: Weiqiong Wang, L.-P. Wang, Haiyan Zhou
Publication date: 5 December 2016
Published in: Finite Fields and their Applications (Search for Journal in Brave)
Abstract: In this paper, we derive an explicit combinatorial formula for the number of -subset sums of quadratic residues over finite fields.
Full work available at URL: https://arxiv.org/abs/1702.03028
Exact enumeration problems, generating functions (05A15) Arithmetic combinatorics; higher degree uniformity (11B30) Other character sums and Gauss sums (11T24)
Cites Work
- On Deciding Deep Holes of Reed-Solomon Codes
- A new sieve for distinct coordinate counting
- On the subset sum problem over finite fields
- Complexity of Decoding Positive-Rate Primitive Reed–Solomon Codes
- On the List and Bounded Distance Decodability of Reed–Solomon Codes
- Linearized Wenger graphs
- Counting subset sums of finite Abelian groups
- An asymptotic formula for counting subset sums over subgroups of finite fields
Cited In (10)
- Subset sums over Galois rings
- Counting points on diagonal equations over Galois rings \(\mathrm{GR}(p^2,p^{2r})\)
- The \(k\)-subset sum problem over finite fields
- On Dℓ‐extensions of odd prime degree ℓ
- Sumsets in quadratic residues
- An approach to the moments subset sum problem through systems of diagonal equations over finite fields
- Title not available (Why is that?)
- Subset sums over Galois rings. II
- Extensions of Schönemann's theorem in Galois rings
- The \(k\)-subset sum problem over finite fields of characteristic 2
This page was built for publication: Subset sums of quadratic residues over finite fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q346285)