Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

FFA
2008

favoriteEmaildiscussreport

76views more FFA 2008»

On the subset sum problem over finite fields

13 years 4 months ago

On the subset sum problem over finite fields

Download www.math.uci.edu

Abstract. The subset sum problem over finite fields is a well known NPcomplete 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 mathematicial point of view. In several interesting cases, we obtain explicit or asymptotic formulas for the solution number. As a consequence, we get some information on the decoding problem of Reed-Solomon codes.

Jiyou Li, Daqing Wan

Real-time Traffic

FFA 2008 | NPcomplete Problem | Reed-Solomon Codes | Subset Sum Problem |

claim paper

Related Content

» On Exponential Sums Nowton identities and Dickson Polynomials over Finite Fields

» Bilinear character sums over elliptic curves

» Solving MediumDensity Subset Sum Problems in Expected Polynomial Time

» Exponential Sums as Discrete Fourier Transform with Invariant Phase Functions

» On integer values of Kloosterman sums

» Confinement of matroid representations to subsets of partial fields

» Noisy interpolation of sparse polynomials in finite fields

» Distribution of irreducible polynomials of small degrees over finite fields

» Convergence Analysis of Reweighted SumProduct Algorithms

Post Info
More Details (n/a)

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2008
Where	FFA
Authors	Jiyou Li, Daqing Wan

Comments (0)