The \(k\)-subset sum problem over finite fields
type: Item
instance of: scholarly article
title: The \(k\)-subset sum problem over finite fields
zbMATH Open document ID: 1421.11098
author: Weiqiong Wang
author: Jennifer Nguyen
published in: Finite Fields and their Applications
publication date: 2018-04-27T00:00:00Z
Mathematics Subject Classification ID: 11T24
Mathematics Subject Classification ID: 11B30
Mathematics Subject Classification ID: 11N36
Mathematics Subject Classification ID: 05A15
zbMATH DE Number: 6865329
zbMATH Keywords: subset sum
zbMATH Keywords: character sum
zbMATH Keywords: distinct coordinate sieve
zbMATH Keywords: absolutely irreducible
MaRDI profile type: Publication
full work available at URL: j.ffa.2018.02.001
OpenAlex ID: W2792309835
cites work: On Deciding Deep Holes of Reed-Solomon Codes
cites work: On the List and Bounded Distance Decodability of Reed–Solomon Codes
cites work: Complexity of Decoding Positive-Rate Primitive Reed–Solomon Codes
cites work: On the subset sum problem over finite fields
cites work: Linearized Wenger graphs
cites work: Introduction to algorithms
cites work: A new sieve for distinct coordinate counting
cites work: Counting subset sums of finite Abelian groups
cites work: An asymptotic formula for counting subset sums over subgroups of finite fields
cites work: Subset sums of quadratic residues over finite fields
cites work: Deep holes in Reed-Solomon codes based on Dickson polynomials
cites work: On the number of solutions of equations of Dickson polynomials over finite fields
cites work: Improved explicit estimates on the number of solutions of equations over a finite field
DOI: 10.1016/J.FFA.2018.02.001
description: scientific article; zbMATH DE number 6865329