An Upper Bound on the Sizes of Multiset-Union-Free Families
DownloadAn upper bound.pdf (393.4Kb)
PUBLISHER_POLICY
Publisher Policy
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Terms of use
Metadata
Show full item recordAbstract
Let F[subscript 1] and F[subscript 2] be two families of subsets of an n-element set. We say that F[subscript 1] and F[subscript 2] are multiset-union-free if for any A, B ∈ F[subscript 1] and C, D ∈ F[subscript 2] 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.
Date issued
2016-05Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science; Massachusetts Institute of Technology. Laboratory for Information and Decision SystemsJournal
SIAM Journal on Discrete Mathematics
Publisher
Society for Industrial and Applied Mathematics
Citation
Ordentlich, Or, and Ofer Shayevitz. “An Upper Bound on the Sizes of Multiset-Union-Free Families.” SIAM Journal on Discrete Mathematics 30.2 (2016): 1032–1045. © 2016 Society for Industrial and Applied Mathematics
Version: Final published version
ISSN
0895-4801
1095-7146