On the subset sum problem over finite fields
From MaRDI portal
Abstract: The subset sum problem over finite fields is a well-known {�f NP}-complete problem. It arises naturally from decoding generalized Reed-Solomon codes. In this paper, we study the number of solutions of the subset sum problem from a mathematical point of view. In several interesting cases, we obtain explicit or asymptotic formulas for the solution number. As a consequence, we obtain some results on the decoding problem of Reed-Solomon codes.
Recommendations
Cites work
- scientific article; zbMATH DE number 3675978 (Why is no real title available?)
- scientific article; zbMATH DE number 872231 (Why is no real title available?)
- Combinatorial Nullstellensatz
- Cyclic Spaces for Grassmann Derivatives and Additive Theory
- On Deciding Deep Holes of Reed-Solomon Codes
- On error distance of Reed-Solomon codes
- On the List and Bounded Distance Decodability of Reed–Solomon Codes
- The Representation of Some Integers as a Subset Sum
Cited in
(40)- Subset sums over Galois rings
- Moment subset sums over finite fields
- Permutations of zero-sumsets in a finite vector space
- The \((+)\)-extended twisted generalized Reed-Solomon code
- An approach to the moments subset sum problem through systems of diagonal equations over finite fields
- Subset sums and block designs in a finite vector space
- A new sieve for restricted multiset counting
- Laced Boolean functions and subset sum problems in finite fields
- On deep holes of standard Reed-Solomon codes
- Extensions of Schönemann's theorem in Galois rings
- Deep holes in Reed-Solomon codes based on Dickson polynomials
- Solving dense subset-sum problems by using analytical number theory
- Some results on deep holes of generalized projective Reed-Solomon codes
- A new family of additive designs
- Generalization of the subset sum problem and cubic forms
- Subset sums of quadratic residues over finite fields
- On Reed-Solomon codes
- Super-regular Steiner 2-designs
- NP-hardness of Reed-Solomon decoding, and the Prouhet-Tarry-Escott problem
- On deep holes of generalized Reed-Solomon codes
- An asymptotic formula for counting subset sums over subgroups of finite fields
- Some results on ordinary words of standard Reed-Solomon codes
- Distinct coordinate solutions of linear equations over finite fields
- The \(k\)-subset sum problem over finite fields
- Binary Hamming codes and Boolean designs
- A reciprocity on finite abelian groups involving zero-sum sequences
- The \(k\)-subset sum problem over finite fields of characteristic 2
- On the error distance of extended Reed-Solomon codes
- A new sieve for distinct coordinate counting
- Counting polynomials with distinct zeros in finite fields
- On the average sensitivity of the weighted sum function
- Explicit constructions of NMDS self-dual codes
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems
- Counting compositions over finite abelian groups
- On a conjecture of polynomials with prescribed range
- Rational points on complete symmetric hypersurfaces over finite fields
- On the subset sum problem for finite fields
- Expressive power, satisfiability and equivalence of circuits over nilpotent algebras
- Subset sums over Galois rings. II
- The \([1, 0]\)-twisted generalized Reed-Solomon code
This page was built for publication: On the subset sum problem over finite fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q958604)
