An Upper Bound on the Sizes of Multiset-Union-Free Families

DOI10.1137/15M1021118zbMath1336.05143arXiv1412.8415MaRDI QIDQ2808160

Ofer Shayevitz, Or Ordentlich

Publication date: 26 May 2016

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1412.8415

zbMATH Keywords

additive combinatorics; binary adder channel; zero error capacity

Mathematics Subject Classification ID

05D05: Extremal set theory

94A15: Information theory (general)

05D40: Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the density of sets of vectors
• A New Bound for the Zero-Error Capacity Region of the Two-User Binary Adder Channel
• Graph theoretic approaches to the code construction for the two-user multiple- access binary adder channel
• A family of good uniquely decodable code pairs for the two-access binary adder channel
• The common information of two dependent random variables
• Source coding with side information and a converse for degraded broadcast channels
• The rate-distortion function for source coding with side information at the decoder
• Bounds on the achievable rates of block coding for a memoryless multiple-access channel
• An upper bound for codes in a two-access binary erasure channel (Corresp.)
• Coding for a multiple-access channel
• Upper bound for uniquely decodable codes in a binary input N-user adder channel
• Construction of uniquely decodable codes for the two-user binary adder channel
• A Coding Theorem for Multiple Access Channels With Correlated Sources
• Determination of two vectors from the sum