Code Construction for Pliable Index Coding
Code Construction for Pliable Index Coding
复制标题
灵活索引编码的代码构建
DOI：
10.1109/isit.2019.8849812
复制
发表时间：
2019
期刊：
影响因子：
--
通讯作者：
B. Rajan
中科院分区：
文献类型：
--
作者：
Shanuja Sasi;B. Rajan
在[S.布拉马角Fragouli，“易变索引编码”，IEEE信息理论学报，第61卷，第11期，第11页。6192-6203，2015]。在PICOD中，我们考虑一个服务器持有一组消息，还有一组客户端拥有一个消息子集。如果每个客户端接收到它没有的任何消息，它就会感到满意。讨论了边信息连续的PICOD类。我们提供了两种情况下的索引代码-为类，每个客户端得到一个所需的消息，并为一类的有效客户端解码的消息的总数是最大化的。索引编码问题的另一个变体是-c-约束柔性索引编码问题[Linqi Song，Christina Fragouli和Tianchu Zhao，“A Pliliable Index Coding Approach to Data Shuffling，”arXiv：1701.05540v3 [cs.IT] 2018年5月3日]。它基本上是具有c约束的PICOD，即每个消息最多由要求该消息的c个客户端解码。我们提供的索引代码的一些类的这种变体与连续的边信息。
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.