On the subset sum problem over finite fields

Simple item page
dc.creatorLi, Jiyou
dc.creatorWan, Daqing
dc.date2007-08-18
dc.date.accessioned2026-07-07T08:24:15Z
dc.date.available2026-07-07T08:24:15Z
dc.descriptionThe 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.
dc.description16 pages
dc.identifierhttps://arxiv.org/abs/0708.2456
dc.identifierhttp://arxiv.org/abs/0708.2456
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/136279
dc.subjectNumber Theory
dc.subjectInformation Theory
dc.subject11T71;94B35
dc.titleOn the subset sum problem over finite fields
dc.typetext

Files

Collections

arXiv