基于Biclique覆盖的安全防帧码
Secure Frameproof Code Through Biclique Cover
摘要:
对于长度为$v$的二进制码$Γ$,如果对于所有$i=1,...,v$,我们有$w_i\in \{w_i^1, ..., w_i^r\}$,则$v$字$w$由码字$\{w^1,...,w^r\} \subseteq Γ$的集合产生。如果$|Γ|=t$和对于任何$v$-由大小至多为$r$的两个集合$C_1$和$C_2$产生的字,则这些集合的交集非空,则我们将代码称为$r$-大小为$t$的安全防帧。一个图$G$的$d$ -biclique cover(英语:$d$ -biclique cover)是$G$的$v$ -完全二部子图的集合,使得$G$的每条边至少属于这些完全二部子图中的$d$。本文证明了对于$t\geq 2r$,存在大小为$t$,长度为$v$的$r$ -安全防帧码当且仅当Kneser图${\rm KG}(t,r)$存在大小为$v$的1-biclique覆盖,该图的顶点都是$t$ -元集的$r$ -子集,且两个$r$ -子集相邻且它们的交集为空.然后我们研究了Kneser图的$d$ -biclique覆盖的最小尺寸与无覆盖族之间的关系,其中$(r,w; d)$无覆盖族是有限集的子集族,使得该族的任何$r$成员的交集至少包含不属于任何其他$w$成员的并集的$d$元素.同时,我们给出了Kneser图的1-偶团覆盖数的一个上界。
英文摘要:
For a binary code $Γ$ of length $v$, a $v$-word $w$ produces by a set of codewords $\{w^1,...,w^r\} \subseteq Γ$ if for all $i=1,...,v$, we have $w_i\in \{w_i^1, ..., w_i^r\}$ . We call a code $r$-secure frameproof of size $t$ if $|Γ|=t$ and for any $v$-word that is produced by two sets $C_1$ and $C_2$ of size at most $r$ then the intersection of these sets is nonempty. A $d$-biclique cover of size $v$ of a graph $G$ is a collection of $v$-complete bipartite subgraphs of $G$ such that each edge of $G$ belongs to at least $d$ of these complete bipartite subgraphs. In this paper, we show that for $t\geq 2r$, an $r$-secure frameproof code of size $t$ and length $v$ exists if and only if there exists a 1-biclique cover of size $v$ for the Kneser graph ${\rm KG}(t,r)$ whose vertices are all $r$-subsets of a $t$-element set and two $r$-subsets are adjacent if their intersection is empty. Then we investigate some connection between the minimum size of $d$-biclique covers of Kneser graphs and cover-free families, where an $(r,w; d)$ cover-free family is a family of subsets of a finite set such that the intersection of any $r$ members of the family contains at least $d$ elements that are not in the union of any other $w$ members. Also, we present an upper bound for 1-biclique covering number of Kneser graphs.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。