The subset sum problem over finite fields is a well-known 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. © 2008 Elsevier Inc.
Li, J., & Wan, D. (2008). On the subset sum problem over finite fields. Finite Fields and Their Applications, 14(4), 911–929. https://doi.org/10.1016/j.ffa.2008.05.003