Subset sums and block designs in a finite vector space
From MaRDI portal
additive designautomorphism groupblock designfinite vector spacepermutations of subset sumssubset sums
Permutations, words, matrices (05A05) Partitions of sets (05A18) Combinatorial aspects of block designs (05B05) Combinatorial aspects of finite geometries (05B25) Additive bases, including sumsets (11B13) Other combinatorial number theory (11B75) Inverse problems of additive number theory, including sumsets (11P70) General block designs in finite geometry (51E05)
Recommendations
Cites work
- A new family of additive designs
- A quasidouble of the affine plane of order 4 and the solution of a problem on additive designs
- A Sylvester-Gallai type theorem for abelian groups
- Additivity of affine designs
- Binary Hamming codes and Boolean designs
- Four fundamental parameters of a code and their combinatorial significance
- scientific article; zbMATH DE number 3627058 (Why is no real title available?)
- scientific article; zbMATH DE number 1382770 (Why is no real title available?)
- On the additivity of block designs
- On the subset sum problem for finite fields
- On the subset sum problem over finite fields
- Permutations of zero-sumsets in a finite vector space
- Super-regular Steiner 2-designs
- The CRC handbook of combinatorial designs
Cited in
(8)- Super-regular Steiner 2-designs
- Permutations of zero-sumsets in a finite vector space
- On the subset sum problem for finite fields
- Maximal sum-free sets and block designs
- Spazi geometrici e codici lineari associati
- A quasidouble of the affine plane of order 4 and the solution of a problem on additive designs
- Combinatorial t-designs from finite abelian groups and elliptic curve codes
- On splitting sets in block designs and finding roots of polynomials
This page was built for publication: Subset sums and block designs in a finite vector space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6101282)