An upper bound on the sizes of multiset-union-free families

Or Ordentlich; Ofer Shayevitz

doi:10.1137/15M1021118

An upper bound on the sizes of multiset-union-free families

Or Ordentlich, Ofer Shayevitz

School of Electrical Engineering

Tel Aviv University

Research output: Contribution to journal › Article › peer-review

Abstract

Let F₁ and F₂ be two families of subsets of an n-element set. We say that F₁ and F₂ are multiset-union-free if for any A,B ϵ F₁ and C,D ϵ F₂ 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.

Original language	English
Pages (from-to)	1032-1045
Number of pages	14
Journal	SIAM Journal on Discrete Mathematics
Volume	30
Issue number	2
DOIs	https://doi.org/10.1137/15M1021118
State	Published - 2016

Keywords

Additive combinatorics
Binary adder channel
Zero error capacity

All Science Journal Classification (ASJC) codes

General Mathematics

Access to Document

10.1137/15M1021118

Cite this

@article{46bb32b3738346309778d2c62e8389ff,

title = "An upper bound on the sizes of multiset-union-free families",

abstract = "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.",

keywords = "Additive combinatorics, Binary adder channel, Zero error capacity",

author = "Or Ordentlich and Ofer Shayevitz",

note = "Publisher Copyright: {\textcopyright} 2016 Society for Industrial and Applied Mathematics.",

year = "2016",

doi = "10.1137/15M1021118",

language = "الإنجليزيّة",

volume = "30",

pages = "1032--1045",

journal = "SIAM Journal on Discrete Mathematics",

issn = "0895-4801",

publisher = "Society for Industrial and Applied Mathematics Publications",

number = "2",

}

TY - JOUR

T1 - An upper bound on the sizes of multiset-union-free families

AU - Ordentlich, Or

AU - Shayevitz, Ofer

PY - 2016

Y1 - 2016

N2 - 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.

AB - 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.

KW - Additive combinatorics

KW - Binary adder channel

KW - Zero error capacity

UR - http://www.scopus.com/inward/record.url?scp=84976864779&partnerID=8YFLogxK

U2 - 10.1137/15M1021118

DO - 10.1137/15M1021118

M3 - مقالة

SN - 0895-4801

VL - 30

SP - 1032

EP - 1045

JO - SIAM Journal on Discrete Mathematics

JF - SIAM Journal on Discrete Mathematics

IS - 2

ER -

An upper bound on the sizes of multiset-union-free families

Abstract

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this