Tight Information Theoretic Converse Results for Some Pliable Index Coding Problems

This paper studies the Pliable Index CODing problem (PICOD), which models content-type distribution networks. In the PICOD ({t}) problem there are {m} messages, {n} users and each user has a distinct message side information set, as in the classical Index Coding problem (IC). Differently from I...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on information theory 2020-05, Vol.66 (5), p.2642-2657
Main Authors: Liu, Tang, Tuninetti, Daniela
Format: Article
Language:English
Subjects:
Coding
Combinatorial analysis
combinatorial design
converse bound
Index coding (IC)
Indexes
Information theory
Integrated circuit modeling
Linear codes
Messages
Network coding
Network topologies
Pliable Index CODing (PICOD)
Transmitters
User satisfaction
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper studies the Pliable Index CODing problem (PICOD), which models content-type distribution networks. In the PICOD ({t}) problem there are {m} messages, {n} users and each user has a distinct message side information set, as in the classical Index Coding problem (IC). Differently from IC, where each user has a pre-specified set of messages to decode, in the PICOD ({t}) a user is "pliable" and is satisfied if it can decode any {t} messages that are not in its side information set. The goal is to find a code with the shortest length that satisfies all the users. This flexibility in determining the desired message sets makes the PICOD ({t}) behave quite differently compared to the IC, and its analysis even more challenging. This paper mainly focuses on the complete - {S} PICOD ({t}) with {m} messages, where the set {S}\subset [{m}] contains the sizes of the side information sets, and the number of users is {n}=\sum _{s\in {S}}\binom {m} {s} , with no two users having the same side information set. Capacity results are shown for: (i) the consecutive complete- {S} PICOD ({t}) , where {S}=[{s}_{\text {min}}:{s}_{\text {max}}] for some 0 \leqslant {s}_{\text {min}}\leqslant {s}_{\text {max}} \leqslant {m}-{t} , and (ii) the complement-consecutive complete- {S} PICOD ({t})
ISSN:0018-9448
1557-9654
DOI:10.1109/TIT.2019.2947669