Metraipolis › archive › dc_8828bdceca43

The Exact Memory-Rate Tradeoff for Three-User Secure Coded Caching — arXiv:2611.06311

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.06311
License (as archived)
CC0-1.0
Archived
2026-11-05T18:28:56.726Z
SHA-256 of the archived text
ab535a64b5695f2aa362451d65dd231e0fbecaf4223e97875f5d6e360fa90584
Stable URL of this page
https://metraipolis.com/documento/dc_8828bdceca43

How to cite

The Exact Memory-Rate Tradeoff for Three-User Secure Coded Caching — arXiv:2611.06311 — arXiv (en), https://arxiv.org/abs/2611.06311 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_8828bdceca43 (Metraipolis archive dc_8828bdceca43, sha256 ab535a64b5695f2aa362451d65dd231e0fbecaf4223e97875f5d6e360fa90584)
BibTeX
@misc{dc8828bdceca43,
  title = {The Exact Memory-Rate Tradeoff for Three-User Secure Coded Caching — arXiv:2611.06311},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.06311},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_8828bdceca43; sha256 ab535a64b5695f2aa362451d65dd231e0fbecaf4223e97875f5d6e360fa90584},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.06311. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We determine the exact zero-error memory-rate tradeoff for secure coded caching with three users and any number $N\ge2$ of independent files. Each user recovers its requested file, while its cache and the broadcast jointly reveal no information about the complete tuple of unrequested files. For $N\ge4$, two converse inequalities establish the optimality of the known achievable points and the memory-sharing segments between them. For $N=3$, two additional bounds identify a new corner at $(M,R)=(3/2,2)$, where memory and rate are measured in file units. An explicit linear code over $\mathbb{F}_3$ attains this corner and reduces the rate by one quarter of a file relative to memory sharing between the known points. The converse links the information held by cache pairs and triples to delivery under repeated and distinct requests. Its equality conditions guide the construction: users cancel the keys to recover their requested files, while uniform masking protects the complete tuple of unrequested files.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.IT, nuovi lavori del giorno).
Categorie arXiv: Information Theory (cs.IT).
Pagina del lavoro: https://arxiv.org/abs/2611.06311 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-05T18:18:48.967Z dalla pagina https://arxiv.org/list/math.IT/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).