Allerton 2015 Paper Abstract


Paper ThD6.4

Ghorbel, Asma (CentraleSupelec), Kobayashi, Mari (CentraleSupelec), Yang, Sheng (CentraleSupelec)

Cache-Enabled Broadcast Packet Erasure Channels with State Feedback

Scheduled for presentation during the Regular Session "Information Theory IV" (ThD6), Thursday, October 1, 2015, 16:30−16:50, Vistior Center

53rd Annual Allerton Conference on Communication, Control, and Computing, Sept 29-Oct 2, 2015, Allerton Park and Retreat Center, Monticello, IL, USA

This information is tentative and subject to change. Compiled on December 5, 2021

Keywords Data Storage, Information Theory, Information Theoretic Approaches in Wireless Communications


We consider a cache-enabled $K$-user broadcast erasure packet channel in which a server with a library of $N$ files wishes to deliver a request file to each user, equipped with a cache of a finite memory $M$. Assuming that the transmitter has the state feedback and user caches can be filled during off-peak hours reliably by decentralized cache placement, we characterize the optimal rate region as a function of the memory size, the erasure probability. The proposed delivery scheme, based on the scheme proposed by Gatzianas et al., exploits the receiver side information established during the placement phase. Our results enable us to quantify the net benefits of decentralized coded caching in the presence of erasure. The role of state feedback is found useful especially when the erasure probability is large and/or the normalized memory size is small.



All Content © PaperCept, Inc..

This site is protected by copyright and trademark laws under US and International law.
All rights reserved. © 2002-2021 PaperCept, Inc.
Page generated 2021-12-05  09:01:12 PST  Terms of use