Multicast capacity of multiple access erasure networks

K. Gowda, S. Sumei
{"title":"Multicast capacity of multiple access erasure networks","authors":"K. Gowda, S. Sumei","doi":"10.1109/ISITA.2008.4895510","DOIUrl":null,"url":null,"abstract":"We derive the capacity of multicast transmissions on a class of erasure networks. The network model incorporates interference in the form of a finite-field additive multiple-access channel for the receiver on each node, but there is no broadcast constraint (any node can transmit independent symbols on each of its outgoing edges). Assuming knowledge of erasure locations at destination nodes, we derive the capacity for a network with multiple sources transmitting independent messages, and each destination node decoding all messages from all source nodes. This capacity is achievable using linear codes at each node.","PeriodicalId":338675,"journal":{"name":"2008 International Symposium on Information Theory and Its Applications","volume":"59 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 International Symposium on Information Theory and Its Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISITA.2008.4895510","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

We derive the capacity of multicast transmissions on a class of erasure networks. The network model incorporates interference in the form of a finite-field additive multiple-access channel for the receiver on each node, but there is no broadcast constraint (any node can transmit independent symbols on each of its outgoing edges). Assuming knowledge of erasure locations at destination nodes, we derive the capacity for a network with multiple sources transmitting independent messages, and each destination node decoding all messages from all source nodes. This capacity is achievable using linear codes at each node.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
多址擦除网络的组播容量
导出了一类擦除网络上的组播传输容量。该网络模型以有限场加性多址信道的形式为每个节点上的接收器合并干扰,但没有广播约束(任何节点都可以在其每个出线上传输独立的符号)。假设目标节点的擦除位置已知,我们推导出具有多个源传输独立消息的网络的容量,每个目标节点解码来自所有源节点的所有消息。这种容量可以在每个节点上使用线性代码来实现。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Capacity of a more general glass of relay channels The maximum achievable array gain under physical transmit power constraint Asymptotic performance bounds of joint channel estimation and multiuser detection in frequency-selective fading DS-CDMA channels On Tomlinson-Harashima precoding in 2-user degraded Gaussian broadcast channels A new class of cryptosystems based on Chinese remainder theorem
×
引用
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