Title :
The rate region of secure symmetrical multilevel diversity coding
Author :
Jiang, Jinjing ; Liu, Tie ; Miller, Scott L.
Author_Institution :
Dept. of Electr. & Comput. Eng., Texas A&M Univ., College Station, TX, USA
Abstract :
This paper considers the problem of secure symmetrical multilevel diversity coding. It is shown that a simple separate encoding scheme known as superposition coding can achieve the entire admissible rate region of the problem. Key to our proof is to establish a nontrivial conditional version of a subset entropy inequality of Yeung and Zhang, which was previously used to prove the optimality of superposition coding in terms of achieving the entire admissible rate region of the classical symmetrical multilevel diversity coding problem without any secrecy constraint.
Keywords :
encoding; telecommunication security; Yeung subset entropy inequality; Zhang subset entropy inequality; admissible rate region; classical symmetrical multilevel diversity coding problem; encoding scheme; secure symmetrical multilevel diversity coding rate region; superposition coding; Computers; Educational institutions; Encoding; Entropy; Minimization; Network coding; Receivers;
Conference_Titel :
Network Coding (NetCod), 2012 International Symposium on
Conference_Location :
Cambridge, MA
Print_ISBN :
978-1-4673-1890-7
DOI :
10.1109/NETCOD.2012.6261878