次速率线性网络编码

Ben Grinboim, Itay Shrem, O. Amrani
{"title":"次速率线性网络编码","authors":"Ben Grinboim, Itay Shrem, O. Amrani","doi":"10.48550/arXiv.2205.13431","DOIUrl":null,"url":null,"abstract":"Increasing network utilization is often considered as the holy grail of communications. In this article, the concept of sub-rate coding and decoding in the framework of linear network coding (LNC) is discussed for single-source multiple-sinks finite acyclic networks. Sub-rate coding offers an add-on to existing LNC. It allows sinks whose max-flow is smaller than the source message-rate, termed \\emph{sub-rate sinks}, to decode a portion of the transmitted message without degrading the maximum achievable rate of LNC sinks whose max-flow is equal (or greater) than the rate of the source node. The article studies theoretical aspects of sub-rate coding by formulating the conditions a node (and indeed the network) must fulfill so as to qualify as a legitimate sub-rate sink.","PeriodicalId":10679,"journal":{"name":"Comput. Phys. Commun.","volume":"80 1","pages":"271-282"},"PeriodicalIF":0.0000,"publicationDate":"2022-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Sub-Rate Linear Network Coding\",\"authors\":\"Ben Grinboim, Itay Shrem, O. Amrani\",\"doi\":\"10.48550/arXiv.2205.13431\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Increasing network utilization is often considered as the holy grail of communications. In this article, the concept of sub-rate coding and decoding in the framework of linear network coding (LNC) is discussed for single-source multiple-sinks finite acyclic networks. Sub-rate coding offers an add-on to existing LNC. It allows sinks whose max-flow is smaller than the source message-rate, termed \\\\emph{sub-rate sinks}, to decode a portion of the transmitted message without degrading the maximum achievable rate of LNC sinks whose max-flow is equal (or greater) than the rate of the source node. The article studies theoretical aspects of sub-rate coding by formulating the conditions a node (and indeed the network) must fulfill so as to qualify as a legitimate sub-rate sink.\",\"PeriodicalId\":10679,\"journal\":{\"name\":\"Comput. Phys. Commun.\",\"volume\":\"80 1\",\"pages\":\"271-282\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-05-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Comput. Phys. Commun.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.48550/arXiv.2205.13431\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Comput. Phys. Commun.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.48550/arXiv.2205.13431","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

提高网络利用率通常被认为是通信的圣杯。本文讨论了单源多汇有限无环网络在线性网络编码(LNC)框架下的子速率编码和译码概念。子速率编码为现有的LNC提供了一个附加组件。它允许最大流量小于源消息速率的接收器(称为\emph{子速率接收器})解码传输消息的一部分,而不会降低最大流量等于(或大于)源节点速率的LNC接收器的最大可实现速率。本文通过阐述节点(实际上是网络)必须满足的条件来研究子速率编码的理论方面,以便有资格成为合法的子速率接收器。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Sub-Rate Linear Network Coding
Increasing network utilization is often considered as the holy grail of communications. In this article, the concept of sub-rate coding and decoding in the framework of linear network coding (LNC) is discussed for single-source multiple-sinks finite acyclic networks. Sub-rate coding offers an add-on to existing LNC. It allows sinks whose max-flow is smaller than the source message-rate, termed \emph{sub-rate sinks}, to decode a portion of the transmitted message without degrading the maximum achievable rate of LNC sinks whose max-flow is equal (or greater) than the rate of the source node. The article studies theoretical aspects of sub-rate coding by formulating the conditions a node (and indeed the network) must fulfill so as to qualify as a legitimate sub-rate sink.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信