Group Complete-$\{s\}$ Pliable Index Coding
Fuente:
arXiv
Guardado en:
| Autores principales: | , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866929340805021696 |
|---|---|
| author | Eghbal, Sina Vellambi, Badri N. Ong, Lawrence Sadeghi, Parastoo |
| author_facet | Eghbal, Sina Vellambi, Badri N. Ong, Lawrence Sadeghi, Parastoo |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2405_07151 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Group Complete-$\{s\}$ Pliable Index Coding Eghbal, Sina Vellambi, Badri N. Ong, Lawrence Sadeghi, Parastoo Information Theory 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. |
| title | Group Complete-$\{s\}$ Pliable Index Coding |
| topic | Information Theory |
| url | https://arxiv.org/abs/2405.07151 |