On multicasting nested message sets over combination networks

S. S. Bidokhti, V. Prabhakaran, S. Diggavi
{"title":"On multicasting nested message sets over combination networks","authors":"S. S. Bidokhti, V. Prabhakaran, S. Diggavi","doi":"10.1109/ITW.2012.6404696","DOIUrl":null,"url":null,"abstract":"In this paper, we study delivery of two nested message sets over combination networks with an arbitrary number of receivers, where a subset of receivers (public receivers) demand only the lower priority message and a subset of receivers (private receivers) demand both the lower and the higher priority messages. We give a complete rate region characterization over combination networks with three public and any number of private receivers, where achievability is through linear coding. Our encoding scheme is general and characterizes an achievable region for arbitrary number of public and private receivers.","PeriodicalId":325771,"journal":{"name":"2012 IEEE Information Theory Workshop","volume":"52 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 IEEE Information Theory Workshop","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITW.2012.6404696","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

In this paper, we study delivery of two nested message sets over combination networks with an arbitrary number of receivers, where a subset of receivers (public receivers) demand only the lower priority message and a subset of receivers (private receivers) demand both the lower and the higher priority messages. We give a complete rate region characterization over combination networks with three public and any number of private receivers, where achievability is through linear coding. Our encoding scheme is general and characterizes an achievable region for arbitrary number of public and private receivers.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
在组合网络上多播嵌套消息集
在本文中,我们研究了在具有任意数量接收者的组合网络上两个嵌套消息集的传递,其中接收者子集(公共接收者)只需要较低优先级的消息,而接收者子集(私有接收者)同时需要较低和较高优先级的消息。我们给出了具有三个公共和任意数量私有接收器的组合网络的完整速率区域表征,其中可通过线性编码实现。我们的编码方案是通用的,并为任意数量的公共和私有接收器提供了一个可实现的区域。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
To code or not to code: Revisited Aspect of security in the cognitive relay assisted interference channels Achievable rate regions for compound multiple access channel with channel state information Degrees of freedom of MISO broadcast channel with perfect delayed and imperfect current CSIT Superposition coding for linear operator channels over finite fields
×
引用
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