Secure joint cache-channel coding over erasure broadcast channels - Archive ouverte HAL Access content directly
Conference Papers Year : 2017

Secure joint cache-channel coding over erasure broadcast channels

(1, 2) , (1) , (2)
1
2

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.
Not file

Dates and versions

cea-01840413 , version 1 (16-07-2018)

Identifiers

Cite

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⟩
34 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More