Skip to Main content Skip to Navigation
Conference papers

Secure joint cache-channel coding over erasure broadcast channels

Abstract : We derive upper and lower bounds on the secure capacity-memory tradeoff of the two-user wiretap erasure BC with cache memory at the weaker receiver. The bounds coincide when the cache memory exceeds a given threshold. The lower bound also exhibits that cache memories provide larger gains under a secrecy constraint than without such a constraint. Moreover, for a large set of parameters the capacity-memory tradeoff is larger if only the weaker receiver has cache memory than when this cache memory is split equally among the receivers. The lower bound is based on a joint cache-channel coding scheme that simultaneously exploits the cache contents and the channel statistics. Such a joint design yields significant gains over a separation-based design.
Document type :
Conference papers
Complete list of metadatas

https://hal-cea.archives-ouvertes.fr/cea-01840413
Contributor : Léna Le Roy <>
Submitted on : Monday, July 16, 2018 - 2:06:30 PM
Last modification on : Wednesday, September 30, 2020 - 8:54:13 AM

Identifiers

Citation

S. Kamel, M. Sarkiss, M. Wigger. Secure joint cache-channel coding over erasure broadcast channels. 2017 IEEE Wireless Communications and Networking Conference (WCNC), Mar 2017, San Francisco, United States. ⟨10.1109/WCNC.2017.7925532⟩. ⟨cea-01840413⟩

Share

Metrics

Record views

117