The \(k\)-subset sum problem over finite fields

DOI10.1016/j.ffa.2018.02.001zbMath1421.11098OpenAlexW2792309835MaRDI QIDQ1747922

Weiqiong Wang, Jennifer Nguyen

Publication date: 27 April 2018

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

Full work available at URL: https://doi.org/10.1016/j.ffa.2018.02.001

zbMATH Keywords

character sumsubset sumdistinct coordinate sieveabsolutely irreducible

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Other character sums and Gauss sums (11T24) Applications of sieve methods (11N36) Arithmetic combinatorics; higher degree uniformity (11B30)

Related Items (6)

Knapsack problems -- an overview of recent advances. I: Single knapsack problems ⋮ Subset sums over Galois rings. II ⋮ Moment subset sums 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

• Unnamed Item
• Deep holes in Reed-Solomon codes based on Dickson polynomials
• Subset sums of quadratic residues over finite fields
• 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 number of solutions of equations of Dickson polynomials over finite fields
• On the subset sum problem over finite fields
• Linearized Wenger graphs
• Improved explicit estimates on the number of solutions of equations over a finite field
• 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: The \(k\)-subset sum problem over finite fields