On the subset sum problem over finite fields

DOI10.1016/J.FFA.2008.05.003zbMath1189.11058arXiv0708.2456OpenAlexW2046947513MaRDI QIDQ958604

Jiyou Li, Daqing Wan

Publication date: 5 December 2008

Published in: Finite Fields and their Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0708.2456

zbMATH Keywords

finite fieldsReed-Solomon codesexplicit formulasdeep holesdecoding problemsubset sum problemasymptotic formulas for the number of solutions

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Other combinatorial number theory (11B75) Congruences in many variables (11D79) Linear Diophantine equations (11D04) Decoding (94B35)

Related Items (36)

Permutations of zero-sumsets in a finite vector space ⋮ Some results on ordinary words of standard Reed-Solomon codes ⋮ Deep holes in Reed-Solomon codes based on Dickson polynomials ⋮ Knapsack problems -- an overview of recent advances. I: Single knapsack problems ⋮ On the error distance of extended Reed-Solomon codes ⋮ Subset sums of quadratic residues over finite fields ⋮ NP-Hardness of Reed--Solomon Decoding, and the Prouhet--Tarry--Escott Problem ⋮ On deep holes of standard Reed-Solomon codes ⋮ Subset sums and block designs in a finite vector space ⋮ On the average sensitivity of the weighted sum function ⋮ A new sieve for distinct coordinate counting ⋮ Subset sums over Galois rings. II ⋮ Rational points on complete symmetric hypersurfaces over finite fields ⋮ The \((+)\)-extended twisted generalized Reed-Solomon code ⋮ On Reed-Solomon codes ⋮ On a conjecture of polynomials with prescribed range ⋮ Counting subset sums of finite Abelian groups ⋮ An asymptotic formula for counting subset sums over subgroups of finite fields ⋮ Expressive Power, Satisfiability and Equivalence of Circuits over Nilpotent Algebras. ⋮ On the subset sum problem for finite fields ⋮ Counting polynomials with distinct zeros in finite fields ⋮ The \(k\)-subset sum problem over finite fields ⋮ Counting compositions over finite abelian groups ⋮ Laced Boolean functions and subset sum problems in finite fields ⋮ A new sieve for restricted multiset counting ⋮ Binary Hamming codes and Boolean designs ⋮ Distinct coordinate solutions of linear equations over finite fields ⋮ Moment subset sums over finite fields ⋮ Subset sums over Galois rings ⋮ A Reciprocity on Finite Abelian Groups Involving Zero-Sum Sequences ⋮ The \(k\)-subset sum problem over finite fields of characteristic 2 ⋮ On deep holes of generalized Reed-Solomon codes ⋮ Some results on deep holes of generalized projective Reed-Solomon codes ⋮ Extensions of Schönemann's theorem in Galois rings ⋮ Super-regular Steiner 2-designs ⋮ A new family of additive designs

Cites Work

• Unnamed Item
• Unnamed Item
• On error distance of Reed-Solomon codes
• Combinatorial Nullstellensatz
• Cyclic Spaces for Grassmann Derivatives and Additive Theory
• The Representation of Some Integers as a Subset Sum
• On Deciding Deep Holes of Reed-Solomon Codes
• On the List and Bounded Distance Decodability of Reed–Solomon Codes

This page was built for publication: On the subset sum problem over finite fields