arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1410.1371cs.ITcs.DMmath.IT
收藏

基于图同态的线性索引编码

Linear Index Coding via Graph Homomorphism

Javad B. Ebrahimi, Mahdi Jafari Siavoshani

摘要:

已知线性索引码在$\mathbb{F}_q$上的最小广播速率等于基础有向图的$minrank_q$。文[3]证明了对$\mathbb{F}_2$和任意正整数$k$,$minrank_q(G)\leq k$当且仅当存在从图$G$的补图到称为“图族$\{G_k\}$“的特殊无向图族的补图的同态.正如在[2]中所观察到的,通过结合这两个结果,可以将无向图的线性索引编码问题与图同态问题联系起来。在文献[4]中,引入了线性索引编码问题与图同态问题之间的直接联系。与前一种方法相反,直接联系也适用于有向图,并且适用于任何域大小。更确切地说,在[4]中,引入了图族$\{H_k^q\}$,并证明了有向图$G$的标量线性指数是否小于或等于$k$等价于存在从$G$的补图到$H_k^q$的补图的图同态。在这里,我们首先研究了有向图$H_k^q$的结构。类似于[2]关于无向图的结果,我们证明了$H_k^q$是点传递有向图。利用这一点,并应用Hell和Nesetril [5]的一个引理,我们得到了有向图$G$满足$lind_q(G)\leq k$的一类必要条件。特别地,我们得到了关于$lind_q(G)$的新的下界.我们的下一个结果是关于有向图的标量线性指标的计算复杂性。对于$k\ge 3$,判定无向图的标量线性指数是否等于$k$是NP完全的,而对于$k=1,2$ [3],判定无向图的标量线性指数是否等于$k$是多项式可判定的.对于有向图,在[6]中表明,对于二进制字母表,$k=2$的判定问题是NP-完全的。我们利用图同态框架将这个结果推广到任意字母表。

英文摘要:

It is known that the minimum broadcast rate of a linear index code over $\mathbb{F}_q$ is equal to the $minrank_q$ of the underlying digraph. In [3] it is proved that for $\mathbb{F}_2$ and any positive integer $k$, $minrank_q(G)\leq k$ iff there exists a homomorphism from the complement of the graph $G$ to the complement of a particular undirected graph family called "graph family $\{G_k\}$". As observed in [2], by combining these two results one can relate the linear index coding problem of undirected graphs to the graph homomorphism problem. In [4], a direct connection between linear index coding problem and graph homomorphism problem is introduced. In contrast to the former approach, the direct connection holds for digraphs as well and applies to any field size. More precisely, in [4], a graph family $\{H_k^q\}$ is introduced and shown that whether or not the scalar linear index of a digraph $G$ is less than or equal to $k$ is equivalent to the existence of a graph homomorphism from the complement of $G$ to the complement of $H_k^q$. Here, we first study the structure of the digraphs $H_k^q$. Analogous to the result of [2] about undirected graphs, we prove that $H_k^q$'s are vertex transitive digraphs. Using this, and by applying a lemma of Hell and Nesetril [5], we derive a class of necessary conditions for digraphs $G$ to satisfy $lind_q(G)\leq k$. Particularly, we obtain new lower bounds on $lind_q(G)$. Our next result is about the computational complexity of scalar linear index of a digraph. It is known that deciding whether the scalar linear index of an undirected graph is equal to $k$ or not is NP-complete for $k\ge 3$ and is polynomially decidable for $k=1,2$ [3]. For digraphs, it is shown in [6] that for the binary alphabet, the decision problem for $k=2$ is NP-complete. We use graph homomorphism framework to extend this result to arbitrary alphabet.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑