TU4.R6.2

Group Complete-{s} Pliable Index Coding

Sina Eghbal, Badri Vellambi, University of Cincinnati, United States; Lawrence Ong, University of Newcastle, Australia; Parastoo Sadeghi, University of New South Wales (Canberra), Australia

Session:
Network Coding 2

Track:
18: Network Coding and Applications

Location:
Sigma/Delta

Presentation Time:
Tue, 9 Jul, 16:25 - 16:45

Session Chair:
Lawrence Ong,
Abstract
This paper introduces a novel class of PICOD(t) problems referred to as g-group complete-S PICOD(t) problems. It constructs a multi-stage achievability scheme to generate pliable index codes for group complete PICOD problems when S = {s} is a singleton set. Using the maximum acyclic induced subgraph bound, lower bounds on the broadcast rate are derived for singleton S, which establishes the optimality of the achievability scheme for a range of values for t and for any g and s. For all other values, it is shown that the achievability scheme is optimal among a restricted class of broadcast codes.
Resources