All Dates/Times are Australian Eastern Standard Time (AEST)

Technical Program

Paper Detail

Paper IDD1-S4-T1.2
Paper Title Pliable Index Coding via Conflict-Free Colorings of Hypergraphs
Authors Prasad Krishnan, International Institute of Information Technology, Hyderabad, India; Rogers Mathew, Subrahmanyam Kalyanasundaram, Indian Institute of Technology, Hyderabad, India
Session D1-S4-T1: Index Coding
Chaired Session: Monday, 12 July, 23:00 - 23:20
Engagement Session: Monday, 12 July, 23:20 - 23:40
Abstract In the pliable index coding (PICOD) problem, a server is to serve multiple clients, each of which possesses a unique subset of the complete message set as side information and requests a new message which it does not have. The goal of the server is to do this using as few transmissions as possible. This work presents a hypergraph coloring approach to the PICOD problem. A \textit{conflict-free coloring} of a hypergraph is known from literature as an assignment of colors to its vertices so that each edge of the graph contains one uniquely colored vertex. For a given PICOD problem represented by a hypergraph consisting of messages as vertices and request-sets as edges, we present achievable PICOD schemes using conflict-free colorings of the PICOD hypergraph. Various graph theoretic parameters arising out of such colorings (and some new coloring variants) then give a number of upper bounds on the optimal PICOD length, which we study in this work. Our achievable schemes based on hypergraph coloring include scalar as well as vector linear PICOD schemes. For the scalar case, using the correspondence with conflict-free coloring, we show the existence of an achievable scheme which has length $O(\log^2\Gamma),$ where $\Gamma$ refers to a parameter of the hypergraph that captures the maximum `incidence' number of other edges on any edge. This result improves upon known achievability results in PICOD literature, in some parameter regimes.