Let F1 and F2 be two families of subsets of an n-element set. We say that F1 and F2 are multiset-union-free if for any A,B ϵ F1 and C,D ϵ F2 the multisets A = C and B = 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.
Bibliographical notePublisher Copyright:
© 2016 Society for Industrial and Applied Mathematics.
- Additive combinatorics
- Binary adder channel
- Zero error capacity