On the subset sum problem for finite fields (Q2238923)

Let \(G\) be the additive group of a finite field. We discuss the number of representations of elements of \(G\) as a sum of \(k\) distinct elements of \(G\), the so-called subset sum problem. \textit{J. Li} and \textit{D. Wan} [Finite Fields Appl. 14, No. 4, 911--929 (2008; Zbl 1189.11058)] determined the exact number of solutions of the subset sum problem over \(G\), by giving an explicit formula for the number of subsets of \(G\) of prescribed size whose elements sum up to a given element of \(G\). They also determined an expression for the case where the subsets are required to contain only nonzero elements. The paper under review gives an alternative proof of the two formulas. The new combinatorial approach is different from original combinatorial approach by Li and Wan, and indicates some new connections with coding theory and combinatorial designs.