Optimal Placement Delivery Arrays from $t$-Designs with Application to Hierarchical Coded Caching
Fuente:
arXiv
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866909120397836288 |
|---|---|
| author | T., Rashid Ummer N. Rajan, B. Sundar |
| author_facet | T., Rashid Ummer N. Rajan, B. Sundar |
| contents | Coded caching scheme originally proposed by Maddah-Ali and Niesen (MN) achieves an optimal transmission rate $R$ under uncoded placement but requires a subpacketization level $F$ which increases exponentially with the number of users $K$ where the number of files $N \geq K$. Placement delivery array (PDA) was proposed as a tool to design coded caching schemes with reduced subpacketization level by Yan \textit{et al.} in \cite{YCT}. This paper proposes two novel classes of PDA constructions from combinatorial $t$-designs that achieve an improved transmission rate for a given low subpacketization level, cache size and number of users compared to existing coded caching schemes from $t$-designs. A $(K, F, Z, S)$ PDA composed of a specific symbol $\star$ and $S$ non-negative integers corresponds to a coded caching scheme with subpacketization level $F$, $K$ users each caching $Z$ packets and the demands of all the users are met with a rate $R=\frac{S}{F}$. For a given $K$, $F$ and $Z$, a lower bound on $S$ such that a $(K, F, Z, S)$ PDA exists is given by Cheng \textit{et al.} in \cite{MJXQ} and by Wei in \cite{Wei} . Our first class of proposed PDA achieves the lower bound on $S$. The second class of PDA also achieves the lower bound in some cases. From these two classes of PDAs, we then construct hierarchical placement delivery arrays (HPDA), proposed by Kong \textit{et al.} in \cite{KYWM}, which characterizes a hierarchical two-layer coded caching system. These constructions give low subpacketization level schemes. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2402_07188 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Optimal Placement Delivery Arrays from $t$-Designs with Application to Hierarchical Coded Caching T., Rashid Ummer N. Rajan, B. Sundar Information Theory Coded caching scheme originally proposed by Maddah-Ali and Niesen (MN) achieves an optimal transmission rate $R$ under uncoded placement but requires a subpacketization level $F$ which increases exponentially with the number of users $K$ where the number of files $N \geq K$. Placement delivery array (PDA) was proposed as a tool to design coded caching schemes with reduced subpacketization level by Yan \textit{et al.} in \cite{YCT}. This paper proposes two novel classes of PDA constructions from combinatorial $t$-designs that achieve an improved transmission rate for a given low subpacketization level, cache size and number of users compared to existing coded caching schemes from $t$-designs. A $(K, F, Z, S)$ PDA composed of a specific symbol $\star$ and $S$ non-negative integers corresponds to a coded caching scheme with subpacketization level $F$, $K$ users each caching $Z$ packets and the demands of all the users are met with a rate $R=\frac{S}{F}$. For a given $K$, $F$ and $Z$, a lower bound on $S$ such that a $(K, F, Z, S)$ PDA exists is given by Cheng \textit{et al.} in \cite{MJXQ} and by Wei in \cite{Wei} . Our first class of proposed PDA achieves the lower bound on $S$. The second class of PDA also achieves the lower bound in some cases. From these two classes of PDAs, we then construct hierarchical placement delivery arrays (HPDA), proposed by Kong \textit{et al.} in \cite{KYWM}, which characterizes a hierarchical two-layer coded caching system. These constructions give low subpacketization level schemes. |
| title | Optimal Placement Delivery Arrays from $t$-Designs with Application to Hierarchical Coded Caching |
| topic | Information Theory |
| url | https://arxiv.org/abs/2402.07188 |