Index coding over correlated sources

S. Miyake, J. Muramatsu
{"title":"Index coding over correlated sources","authors":"S. Miyake, J. Muramatsu","doi":"10.1109/NETCOD.2015.7176785","DOIUrl":null,"url":null,"abstract":"One of the promising architectures for the next generation of content distribution networks is the “cache network”, where each node has cache or local storage.We consider the index coding problem, where a central content server disseminates compressed multiple content data to each client that recovers the target content using the cached content, as side information. The coding scheme discussed in this paper is proposed under the condition that there is some correlation between multiple contents, and the scheme is shown to be optimal when the content is less than or equal to three. We believe the sum-product algorithm or linear programming can be used to implement an efficient code by constructing the proposed code using sparse matrices.","PeriodicalId":129376,"journal":{"name":"2015 International Symposium on Network Coding (NetCod)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 International Symposium on Network Coding (NetCod)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NETCOD.2015.7176785","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

Abstract

One of the promising architectures for the next generation of content distribution networks is the “cache network”, where each node has cache or local storage.We consider the index coding problem, where a central content server disseminates compressed multiple content data to each client that recovers the target content using the cached content, as side information. The coding scheme discussed in this paper is proposed under the condition that there is some correlation between multiple contents, and the scheme is shown to be optimal when the content is less than or equal to three. We believe the sum-product algorithm or linear programming can be used to implement an efficient code by constructing the proposed code using sparse matrices.
对相关源进行索引编码
下一代内容分发网络的一个很有前途的架构是“缓存网络”,其中每个节点都有缓存或本地存储。我们考虑索引编码问题,其中中央内容服务器将压缩的多个内容数据分发给每个客户端,这些客户端使用缓存的内容作为副信息恢复目标内容。本文所讨论的编码方案是在多个内容之间存在一定相关性的条件下提出的,当内容小于等于3时,该方案是最优的。我们相信和积算法或线性规划可以通过使用稀疏矩阵构造所提出的代码来实现高效的代码。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信