AN UPPER BOUND ON THE SIZES OF MULTISET-UNION-FREE FAMILIES

作者：Ordentlich O R^*; Shayevitz Ofer

来源：SIAM Journal on Discrete Mathematics, 2016, 30(2): 1032-1045.

DOI：10.1137/15M1021118

• binary adder channel
• zero error capacity
• additive combinatorics

Let F-1 and F-2 be two families of subsets of an n-element set. We say that F-1 and F-2 are multiset-union-free if for any A, B is an element of F-1 and C, D is an element of F-2 the multisets A boolean OR C and B boolean OR D are different, unless both A = B and C = D. We derive a new upper bound on the maximal sizes of multiset-union-free pairs, improving a result of Urbanke and Li.

• 出版日期2016