Name
Abstract | ||
|---|---|---|
Cover-free families have been widely studied over recent decades due to their applications in numerous subjects. In this paper, we introduce the concept of (s,t;d)-union–intersection-bounded families, which is a generalization of t-cover-free families. We provide a general upper bound on the maximum size of an (s,t;d)-union–intersection-bounded family, and show a probabilistic lower bound for the case that the ground set is sufficiently large. They have the same order of magnitude for certain cases. We also discuss the applications of (s,t;d)-union–intersection-bounded families in broadcast encryption, and derive a better upper bound for (1,t;d)-union–intersection-bounded families (also known as superimposed distance codes). |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1016/j.dam.2018.12.002 | Discrete Applied Mathematics |
Keywords | Field | DocType |
Cover-free family,Union–intersection-bounded family,Broadcast encryption,Superimposed distance code | Broadcast encryption,Discrete mathematics,Combinatorics,Upper and lower bounds,Probabilistic logic,Order of magnitude,Mathematics,Bounded function | Journal |
Volume | ISSN | Citations |
266 | 0166-218X | 1 |
PageRank | References | Authors |
0.35 | 8 | 2 |