Abstract
Symmetrical Multilevel Diversity Coding (SMDC) is a network compression problem introduced by Roche (1992) and Yeung (1995). This paper considers a generalization of SMDC for which, in addition to the randomly accessible encoders, there is also an all-access encoder. It is shown that a simple separate coding strategy known as superposition coding is optimal in terms of achieving the entire admissible rate region of the problem. Key to our proof is to identify the supporting hyperplanes that define the boundary of the admissible rate region and then builds on the result of Yeung and Zhang on a generalization of Han's subset inequality.
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.
