2024/05/12 by Sina Eghbal, Badri N. Vellambi, Eghbal, Sina +5 · 1 citation
Computer Science · Engineering · #Coding theory and cryptography #Cooperative Communication and Network Coding #FOS: Computer and information sciences #Information Theory (cs.IT) #graph theory and CDMA systems
paper · pdf · doi:10.48550/arxiv.2405.07151
openalex publication_date 2024/05/12 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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 the restricted class of broadcast codes.