On the subset sum problem for finite fields
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3178047 (Why is no real title available?)
- Additivity of affine designs
- An addition theorem for Abelian groups of order \(pq\)
- Binary Hamming codes and Boolean designs
- On Deciding Deep Holes of Reed-Solomon Codes
- On the addition of residue classes mod p
- On the additivity of block designs
- On the condensation points of the Lagrange spectrum
- On the subset sum problem over finite fields
- Perfect binary codes: constructions, properties, and enumeration
- Permutations of zero-sumsets in a finite vector space
- Subset sums and block designs in a finite vector space
- The subset sum problem for finite abelian groups
Cited in
(17)- Moment subset sums over finite fields
- On the subset sum problem over finite fields
- Subset sums and block designs in a finite vector space
- Laced Boolean functions and subset sum problems in finite fields
- Sum uniform subsets of the integers modulo \(p\) and an application to finite fields
- The number of sumsets in a finite field
- A new family of additive designs
- scientific article; zbMATH DE number 2188380 (Why is no real title available?)
- The subset sum problem for finite abelian groups
- Super-regular Steiner 2-designs
- An asymptotic formula for counting subset sums over subgroups of finite fields
- Linear subspaces of finite fields with large inverse-closed subsets
- The \(k\)-subset sum problem over finite fields
- The \(k\)-subset sum problem over finite fields of characteristic 2
- Subsets in linear spaces over the finite field \(\mathbb F_3\) uniquely determined by their pairwise sums collection
- Power sums over subspaces of finite fields
- Subset sums over Galois rings. II
This page was built for publication: On the subset sum problem for finite fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2238923)