On \(B_ 2\)-sequences of vectors

DOI10.1016/0022-314X(72)90052-2zbMath0235.10028MaRDI QIDQ2551781

Bernt Lindström

Publication date: 1972

Published in: Journal of Number Theory (Search for Journal in Brave)

Mathematics Subject Classification ID

Other combinatorial number theory (11B75) Rate of growth of arithmetic functions (11N56)

Related Items (14)

Search problems on graphs ⋮ Search problems: One, two or many rounds ⋮ On sum sets of Sidon sets. II ⋮ A ternary search problem on graphs ⋮ Recovering affine linearity of functions from their restrictions to affine lines ⋮ Improved upper bounds for parent-identifying set systems and separable codes ⋮ Searching for a subset of counterfeit coins: Randomization vs determinism and adaptiveness vs non‐adaptiveness ⋮ Signature codes for noisy multiple access adder channel ⋮ Binary \(B_2\)-sequences: a new upper bound ⋮ On the number of divisors which are values of a polynomial ⋮ Sidon sets in \(\mathbb N^d\) ⋮ Optimal query complexity bounds for finding graphs ⋮ A note on \(\overline{2} \)-separable codes and \(B_2\) codes ⋮ Tropical Complexity, Sidon Sets, and Dynamic Programming

Cites Work

• Unnamed Item
• Determination of two vectors from the sum
• An inequality for B2-sequences
• A remark on B4-Sequences
• On a Problem of Sidon in Additive Number Theory, and on some Related Problems

This page was built for publication: On \(B_ 2\)-sequences of vectors