New optimal trade-off point for coded caching systems with limited cache size

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 i...

Full description

Saved in:
Bibliographic Details
Published in:arXiv.org 2024-06
Main Authors: Ma, Yinbin, Tuninetti, Daniela
Format: Article
Language:English
Subjects:
Caching
Coding
Fields (mathematics)
Optimization
Placement
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:2331-8422