约简函数依赖图及其应用
Reduced Functional Dependence Graph and Its Applications
摘要:
函数依赖图(FDG)是一类重要的有向图,它描述了变量之间的支配关系。FDG常用于计算网络编码容量界限。然而,FDG的阶数通常比原始网络大得多,并且许多边界的计算复杂性随着FDG的阶数呈指数增长。在本文中,我们引入了约化FDG的概念,它是从原始FDG得到的,只保留那些“必要”的边缘。证明了约化FDG具有与原FDG相同的容量域/界,但计算量大大减少。本文还讨论了约化FDG在标量线性网络编码代数公式中的应用。
英文摘要:
Functional dependence graph (FDG) is an important class of directed graph that captures the dominance relationship among a set of variables. FDG is frequently used in calculating network coding capacity bounds. However, the order of FDG is usually much larger than the original network and the computational complexity of many bounds grows exponentially with the order of FDG. In this paper, we introduce the concept of reduced FDG, which is obtained from the original FDG by keeping only those "essential" edges. It is proved that the reduced FDG gives the same capacity region/bounds with the original FDG, but requiring much less computation. The applications of reduced FDG in the algebraic formulation of scalar linear network coding is also discussed.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。