Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 0708.2456

On the subset sum problem over finite fields

Jiyou Li·Daqing Wan
View original source ↗Read source document ↗Export metadata ↓

Abstract

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.

Explore related subjects

math.NTcs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jiyou Li, Daqing Wan. 2007-08-18. On the subset sum problem over finite fields. https://arxiv.org/abs/0708.2456

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

A few remarks on a Manin-Mumford conjecture in function field arithmetic and generalized Pila-Wilkie estimates

We present here the natural extension of our Pila-Wilkie type estimates on the number of rational points of the trascendent part of a compact analytic subset of $\mathbb{F}_{q}((1/T))^{n}$ to analogous subsets of $K^{n}$, where $K$ is a general local field of any characteristic. That would integrate the analogous estimate provided by F. Loeser, G. Comte and R. Cluckers in characteristic 0.

math.NT↗
arXiv2026

No new Goormaghtigh primes up to $10^{700}$

The Goormaghtigh conjecture states that the only two numbers which have two non-trivial representations as repunits are $31$ and $8191$. We call such a prime number a {\it Goormaghtigh prime}. We show that there are no other Goormaghtigh primes less than $10^{700}$.

math.NT↗