Code Construction for Pliable Index Coding

Shanuja Sasi, B. Rajan
{"title":"Code Construction for Pliable Index Coding","authors":"Shanuja Sasi, B. Rajan","doi":"10.1109/ISIT.2019.8849812","DOIUrl":null,"url":null,"abstract":"A new variant of index coding problem termed as Pliable Index Coding Problem (PICOD) is formulated in [S. Brahma, C. Fragouli, \"Pliable index coding\", IEEE Transactions on Information Theory, vol. 61, no. 11, pp. 6192-6203, 2015]. In PICOD, we consider a server holding a set of messages and there is a set of clients having a subset of messages with them. Each client is satisfied if it receives any of the message which it doesn’t have. We discuss the class of PICOD where the side information is consecutive. We provide index codes for two cases - for the class where each client gets exactly one desired message and for a class where total number of messages decoded by the effective clients is maximized. Another variant of index coding problem is - c-Constrained Pliable Index Coding Problem [Linqi Song, Christina Fragouli and Tianchu Zhao, \"A Pliable Index Coding Approach to Data Shuffling,\" arXiv:1701.05540v3 [cs.IT] 3 May 2018]. It is basically PICOD with a c-constraint, i.e, each message is decoded by at most c clients demanding that message. We provide index codes for some classes of this variant with consecutive side information.","PeriodicalId":6708,"journal":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","volume":"1 1","pages":"527-531"},"PeriodicalIF":0.0000,"publicationDate":"2019-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE International Symposium on Information Theory (ISIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2019.8849812","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

Abstract

A new variant of index coding problem termed as Pliable Index Coding Problem (PICOD) is formulated in [S. Brahma, C. Fragouli, "Pliable index coding", IEEE Transactions on Information Theory, vol. 61, no. 11, pp. 6192-6203, 2015]. In PICOD, we consider a server holding a set of messages and there is a set of clients having a subset of messages with them. Each client is satisfied if it receives any of the message which it doesn’t have. We discuss the class of PICOD where the side information is consecutive. We provide index codes for two cases - for the class where each client gets exactly one desired message and for a class where total number of messages decoded by the effective clients is maximized. Another variant of index coding problem is - c-Constrained Pliable Index Coding Problem [Linqi Song, Christina Fragouli and Tianchu Zhao, "A Pliable Index Coding Approach to Data Shuffling," arXiv:1701.05540v3 [cs.IT] 3 May 2018]. It is basically PICOD with a c-constraint, i.e, each message is decoded by at most c clients demanding that message. We provide index codes for some classes of this variant with consecutive side information.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
柔性索引编码的代码构造
本文提出了索引编码问题的一个新变体,称为柔性索引编码问题(PICOD)。Brahma, C. Fragouli,“柔韧索引编码”,IEEE信息理论汇刊,第61卷,第61期。[j].中国科学院学报(自然科学版),2015。在PICOD中,我们考虑一个服务器持有一组消息,而有一组客户端拥有一组消息。如果每个客户端接收到它没有的任何消息,它就会感到满意。我们讨论了边信息是连续的PICOD类。我们为两种情况提供了索引代码——对于每个客户端只获得一条所需消息的类,以及对于有效客户端解码的消息总数最大化的类。宋林奇,Christina Fragouli,赵天初,“一种面向数据变换的柔性索引编码方法”,《计算机工程学报》,第4期:1701 - 1701 [c]。[2018年5月3日]。它基本上是带有c约束的PICOD,即每条消息由最多c个要求该消息的客户端解码。我们为该变体的某些类提供了具有连续侧信息的索引代码。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
相关文献
Common-path digital holographic microscopy and its applications
IF 0 SPIE/COS Photonics AsiaPub Date : 2016-10-31 DOI: 10.1117/12.2245313
Jianlin Zhao, Jianglei Di, Jiwei Zhang, Chaojie Ma
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Gambling and Rényi Divergence Irregular Product Coded Computation for High-Dimensional Matrix Multiplication Error Exponents in Distributed Hypothesis Testing of Correlations Pareto Optimal Schemes in Coded Caching Constrained de Bruijn Codes and their Applications
×
引用
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