基本熵集

I. Grivell, A. Grant, T. Chan
{"title":"基本熵集","authors":"I. Grivell, A. Grant, T. Chan","doi":"10.1109/NETCOD.2008.4476184","DOIUrl":null,"url":null,"abstract":"The entropy space for n random variables has dimension 2n -1, one dimension for each joint entropy. When the random variables are known to satisfy given functional dependence relationships, the dimension may be smaller. In this paper, we identify a basis for the restriction of the entropy space to distributions satisfying functional dependence relations specified by an acyclic graph. We provide an efficient algorithm for determination of this basis. One application is a reduction in the computational effort required to compute the linear programming bound for multi-source network coding.","PeriodicalId":186056,"journal":{"name":"2008 Fourth Workshop on Network Coding, Theory and Applications","volume":"70 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Basic Entropy Sets\",\"authors\":\"I. Grivell, A. Grant, T. Chan\",\"doi\":\"10.1109/NETCOD.2008.4476184\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The entropy space for n random variables has dimension 2n -1, one dimension for each joint entropy. When the random variables are known to satisfy given functional dependence relationships, the dimension may be smaller. In this paper, we identify a basis for the restriction of the entropy space to distributions satisfying functional dependence relations specified by an acyclic graph. We provide an efficient algorithm for determination of this basis. One application is a reduction in the computational effort required to compute the linear programming bound for multi-source network coding.\",\"PeriodicalId\":186056,\"journal\":{\"name\":\"2008 Fourth Workshop on Network Coding, Theory and Applications\",\"volume\":\"70 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-03-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 Fourth Workshop on Network Coding, Theory and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NETCOD.2008.4476184\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 Fourth Workshop on Network Coding, Theory and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NETCOD.2008.4476184","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

n个随机变量的熵空间有2n -1维,每个联合熵有一个维。当已知随机变量满足给定的函数依赖关系时,维数可能更小。本文给出了熵空间对满足非循环图所指定的函数依赖关系的分布的约束的一个基。我们提供了一个有效的算法来确定这个基础。一个应用是减少了计算多源网络编码的线性规划边界所需的计算工作量。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Basic Entropy Sets
The entropy space for n random variables has dimension 2n -1, one dimension for each joint entropy. When the random variables are known to satisfy given functional dependence relationships, the dimension may be smaller. In this paper, we identify a basis for the restriction of the entropy space to distributions satisfying functional dependence relations specified by an acyclic graph. We provide an efficient algorithm for determination of this basis. One application is a reduction in the computational effort required to compute the linear programming bound for multi-source network coding.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Some Recent Progresses in Network Error Correction Coding Theory A Graham-Sloane Type Construction of Constant Dimension Codes Gossiping in Networks: Towards Understanding the Power of Protocols and Network Coding Joint Network Coding and Subcarrier Assignment in OFDMA-Based WVireless Networks Network Spread Coding
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1