A Hypergraph based lower bound on Pliable Index Coding based on Nested Side-Information Sets

TL;DR

This paper introduces a new lower bound for the optimal length of pliable index coding using a hypergraph structural parameter called the nesting number, offering computational advantages and tight bounds in certain structured cases.

Contribution

The paper proposes a novel lower bound for PICOD length based on the nesting number of the associated hypergraph, providing new insights and bounds for structured problems.

Findings

Nesting number bound offers computational advantages.

The bound is tight for certain structured PICOD problems.

Provides new lower bounds for specific PICOD instances.

Abstract

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 $\ell$ is a set of $\ell$ 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 present a new lower bound for the optimal PICOD length using a new structural parameter called the nesting number, denoted by $\eta(\ch)$ associated with the hypergraph $\ch$ that represents the PICOD problem. While the nesting number bound is not stronger than previously known bounds, it can provide some computational advantages over them. Also, using the nesting number bound, we obtain novel lower bounds for some PICOD problems with special structures, which are tight in some cases.