Union–intersection-bounded families and their applications

Y. Gu, Ying Miao

研究成果: Contribution to journalArticle査読

1 被引用数 (Scopus)

抄録

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

本文言語英語
ページ(範囲)346-354
ページ数9
ジャーナルDiscrete Applied Mathematics
266
DOI
出版ステータス出版済み - 8 15 2019
外部発表はい

All Science Journal Classification (ASJC) codes

  • 離散数学と組合せ数学
  • 応用数学

フィンガープリント

「Union–intersection-bounded families and their applications」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル