On the subset sum problem over finite fields

Details On the subset sum problem over finite fields On the subset sum problem over finite fields

2007-08-18

arxiv.org/abs/0708.2456v1

Mathematics

Number Theory

16 pages

Scientific paper

The subset sum problem over finite fields is a well-known {\bf 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.

Affiliated with

Also associated with

No associations

Rating

On the subset sum problem over finite fields does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the subset sum problem over finite fields, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the subset sum problem over finite fields will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-329358