scientific article; zbMATH DE number 1315277
From MaRDI portal
Publication:4256493
Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Additive number theory; partitions (11P99) Linear codes (general theory) (94B05) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)
Recommendations
Cited in
(21)- Subset sums in binary spaces
- A coding theory bound and zero-sum square matrices
- Sets in \(\mathbb{Z}_n\) with distinct sums of pairs.
- A connection between sumsets and covering codes of a module
- A polynomial bound in Freiman's theorem.
- How long does it take to generate a group?
- On the subgroup generated by a small doubling binary set
- Generating binary spaces.
- A multiplicative property for zero-sums. I
- A multiplicative property for zero-sums. II
- The Modular Subset-Sum Problem and the size of deletion correcting codes
- On S_h-sequences of binary vectors and linear codes
- scientific article; zbMATH DE number 3995979 (Why is no real title available?)
- Multi-wise and constrained fully weighted Davenport constants and interactions with coding theory
- On zero-sum subsequences of length not exceeding a given number
- Subsets of defect 3 in elementary Abelian 2-groups
- Binary \(B_2\)-sequences: a new upper bound
- Structure of a sequence with prescribed zero-sum subsequences: rank two p-groups
- On large Sidon sets
- The geometry of intersecting codes and applications to additive combinatorics and factorization theory
- Remarks on a generalization of the Davenport constant
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4256493)
