Bounding the Optimal Length of Pliable Index Coding via a Hypergraph-based Approach

08/22/2022
by   Tulasi Sowjanya B., et al.
0

In pliable index coding (PICOD), a number of clients are connected via a noise-free broadcast channel to a server which has a list of messages. Each client has a unique subset of messages at the server as side-information and requests for any one message not in the side-information. A PICOD scheme of length ℓ is a set of ℓ encoded transmissions broadcast from the server such that all clients are satisfied. Finding the optimal (minimum) length of PICOD and designing PICOD schemes that have small length are the fundamental questions in PICOD. In this paper, we use a hypergraph-based approach to derive new achievability and converse results for PICOD. We present an algorithm which gives an achievable scheme for PICOD with length at most Δ(ℋ), where Δ(ℋ) is the maximum degree of any vertex in a hypergraph that represents the PICOD problem. We also give a lower bound for the optimal PICOD length using a new structural parameter associated with the PICOD hypergraph called the nesting number. Finally, we identify a class of problems for which our converse is tight, and also characterize the optimal PICOD lengths of problems with Δ(ℋ)∈{1,2,3}.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/03/2021

Pliable Index Coding via Conflict-Free Colorings of Hypergraphs

In the pliable index coding (PICOD) problem, a server is to serve multip...
research
09/21/2018

Privacy in Index Coding: k-Limited-Access Schemes

In the traditional index coding problem, a server employs coding to send...
research
09/10/2019

A Loosely Self-stabilizing Protocol for Randomized Congestion Control with Logarithmic Memory

We consider congestion control in peer-to-peer distributed systems. The ...
research
05/18/2020

Joint Index Coding and Incentive Design for Selfish Clients

The index coding problem includes a server, a group of clients, and a se...
research
01/11/2018

Privacy in Index Coding: Improved Bounds and Coding Schemes

It was recently observed in [1], that in index coding, learning the codi...
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
08/29/2018

Short Plane Supports for Spatial Hypergraphs

A graph G=(V,E) is a support of a hypergraph H=(V,S) if every hyperedge ...

Please sign up or login with your details

Forgot password? Click here to reset