Determination of two vectors from the sum
From MaRDI portal
Cited in
(26)- Sidon sets in groups and induced subgraphs of Cayley graphs
- Search problems on graphs
- A ternary search problem on graphs
- Reconstructing a Hamiltonian cycle by querying the graph: Application to DNA physical mapping
- Search problems: One, two or many rounds
- On sum sets of Sidon sets. II
- Random and quasi-random designs in group testing
- Improved upper bounds for parent-identifying set systems and separable codes
- On \(B_ 2\)-sequences of vectors
- An upper bound on the sizes of multiset-union-free families
- Tropical complexity, Sidon sets, and dynamic programming
- Extremal problems on the hypercube and the codegree Turán density of complete r-graphs
- Minkowski complexity of sets: an easy lower bound
- A Small Maximal Sidon Set in ${\mathbb{Z}}_2^n$
- Approximation limitations of pure dynamic programming
- Binary \(B_2\)-sequences: a new upper bound
- A better bound for locally thin set families
- Near-sunflowers and focal families
- Frameproof codes, separable codes and \(B_2\) codes: bounds and constructions
- Optimal adjacency labels for subgraphs of Cartesian products
- Avoiding intersections of given size in finite affine spaces \(\operatorname{AG}(n,2)\)
- On large Sidon sets
- Unsourced random access
- Sidon sets, thin sets, and the nonlinearity of vectorial Boolean functions
- Remarks on a generalization of the Davenport constant
- Applications of coding theory to communication combinatorial problems
This page was built for publication: Determination of two vectors from the sum
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5556461)
