Decentralized Pliable Index Coding

04/10/2019
by   Tang Liu, et al.
0

This paper introduces the decentralized Pliable Index CODing (PICOD) problem: a variant of the Index Coding (IC) problem, where a central transmitter serves pliable users with message side information; here, pliable refers to the fact that a user is satisfied by decoding any t messages that are not in its side information set. In the decentralized PICOD, a central transmitter with knowledge of all messages is not present, and instead users share among themselves massages that can only depend on their local side information set. This paper characterizes the capacity of two classes of decentralized complete--S PICOD(t) problems with m messages (where the set S⊂[m] contains the sizes of the side information sets, and the number of users is n=∑_s∈ Sms, with no two users having the same side information set): (i) the consecutive case: S=[s_:s_] for some 0 ≤ s_≤ s_≤ m-t, and (ii) the complement-consecutive case: S=[0:m-t][s_:s_], for some 0 < s_≤ s_ < m-t. Interestingly, the optimal code-length for the decentralized PICOD in those cases is the same as for the classical (centralized) PICOD counterpart, except when the problem is no longer pliable, that is, it reduces to an IC problem where every user needs to decode all messages not in its side information set. Although the optimal code-length may be the same in both centralized and decentralized settings, the actual optimal codes are not. For the decentralized PICOD, sparse Maximum Distance Separable (MDS) codes and vector linear index codes are used (as opposed to scalar linear codes).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/13/2018

Optimal Scalar Linear Index Codes for Symmetric and Neighboring Side-information Problems

A single unicast index coding problem (SUICP) is called symmetric neighb...
research
06/13/2018

An Information Theoretic Converse for the "Consecutive Complete--S" PICOD Problem

Pliable Index CODing (PICOD) is a variant of the Index Coding (IC) probl...
research
01/11/2020

Secure Decentralized Pliable Index Coding

This paper studies a variant of the Pliable Index CODing (PICOD) problem...
research
10/20/2020

Optimal Linear Coding Schemes for the Secure Decentralized Pliable Index Coding Problem

We study the secure decentralized Pliable Index CODing (PICOD) problem w...
research
01/17/2019

On Pliable Index Coding

A new variant of index coding problem termed as Pliable Index Coding Pro...
research
10/04/2018

Tight Information Theoretic Converse Results for some Pliable Index Coding Problems

This paper studies the Pliable Index CODing problem (PICOD), which model...
research
12/11/2011

Maximum Production of Transmission Messages Rate for Service Discovery Protocols

Minimizing the number of dropped User Datagram Protocol (UDP) messages i...

Please sign up or login with your details

Forgot password? Click here to reset