On the subset sum problem over finite fields

DOI10.1016/j.ffa.2008.05.003zbMath1189.11058arXiv0708.2456MaRDI QIDQ958604

Daqing Wan, Jiyou Li

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 fields; Reed-Solomon codes; explicit formulas; deep holes; decoding problem; subset sum problem; asymptotic formulas for the number of solutions

Mathematics Subject Classification ID

11T71: Algebraic coding theory; cryptography (number-theoretic aspects)

11B75: Other combinatorial number theory

11D79: Congruences in many variables

11D04: Linear Diophantine equations

94B35: Decoding

Related Items

On the average sensitivity of the weighted sum function, On a conjecture of polynomials with prescribed range, A new sieve for distinct coordinate counting, Counting subset sums of finite Abelian groups, An asymptotic formula for counting subset sums over subgroups of finite fields, On deep holes of standard Reed-Solomon codes, Laced Boolean functions and subset sum problems in finite fields, On Reed-Solomon codes

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