The \(k\)-subset sum problem over finite fields of characteristic 2

DOI10.1016/j.ffa.2019.05.003zbMath1454.11220OpenAlexW2950993443WikidataQ127659751 ScholiaQ127659751MaRDI QIDQ2326691

Hyok Choe, Chunghyok Choe

Publication date: 10 October 2019

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

Full work available at URL: https://doi.org/10.1016/j.ffa.2019.05.003

zbMATH Keywords

character sumsubset sum

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Other character sums and Gauss sums (11T24)

Related Items (2)

Knapsack problems -- an overview of recent advances. I: Single knapsack problems ⋮ Moment subset sums over finite fields

Cites Work

• Deep holes in Reed-Solomon codes based on Dickson polynomials
• Subset sums of quadratic residues over finite fields
• Value sets of Dickson polynomials over finite fields
• 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 the subset sum problem over finite fields
• The \(k\)-subset sum problem over finite fields

This page was built for publication: The \(k\)-subset sum problem over finite fields of characteristic 2