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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
