New optimal trade-off point for coded caching systems with limited cache size
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | Preprint |
| Publié: |
2023
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866916280600100864 |
|---|---|
| author | Ma, Yinbin Tuninetti, Daniela |
| author_facet | Ma, Yinbin Tuninetti, Daniela |
| contents | This paper presents a new achievable scheme for coded caching systems with $\mathsf{N}$ files, $\mathsf{K}=\mathsf{N}$ users, and cache size $\mathsf{M}=1/(\mathsf{N}-1)$. The scheme employs linear coding during the cache placement phase, and a three-stage transmissions designed to eliminate interference in the delivery phase. The achievable load meets a known converse bound, which impose no constraint on the cache placement, and is thus optimal. This new result, together with known inner and outer bounds, shows optimality of linear coding placement for $\mathsf{M} \leq 1/(\mathsf{N}-1)$ when $\mathsf{K}=\mathsf{N}\geq 3$. Interestingly and surprisingly, the proposed scheme is relatively simple but requires operations on a finite field of size at least 3. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2310_07686 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | New optimal trade-off point for coded caching systems with limited cache size Ma, Yinbin Tuninetti, Daniela Information Theory This paper presents a new achievable scheme for coded caching systems with $\mathsf{N}$ files, $\mathsf{K}=\mathsf{N}$ users, and cache size $\mathsf{M}=1/(\mathsf{N}-1)$. The scheme employs linear coding during the cache placement phase, and a three-stage transmissions designed to eliminate interference in the delivery phase. The achievable load meets a known converse bound, which impose no constraint on the cache placement, and is thus optimal. This new result, together with known inner and outer bounds, shows optimality of linear coding placement for $\mathsf{M} \leq 1/(\mathsf{N}-1)$ when $\mathsf{K}=\mathsf{N}\geq 3$. Interestingly and surprisingly, the proposed scheme is relatively simple but requires operations on a finite field of size at least 3. |
| title | New optimal trade-off point for coded caching systems with limited cache size |
| topic | Information Theory |
| url | https://arxiv.org/abs/2310.07686 |