Symmetrical Multilevel Diversity Coding with an All-Access Encoder Conference Paper

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. 2012 IEEE.

name of conference

• 2012 IEEE International Symposium on Information Theory Proceedings

authors

• Liu, Tie

published proceedings

• 2012 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT)

author list (cited authors)

• Jiang, J., Marukala, N., & Liu, T.

citation count

• 4

complete list of authors

• Jiang, Jinjing||Marukala, Neeharika||Liu, Tie

publication date

• July 2012

publisher

• Institute of Electrical and Electronics Engineers (IEEE)  Publisher

keywords

• Han's Inequality
• Sliding Window Entropy Inequality
• Superposition Coding
• Symmetrical Multilevel Diversity Coding

Digital Object Identifier (DOI)

• 10.1109/isit.2012.6283559

International Standard Book Number (ISBN) 13

• 9781467325790

URI

• https://hdl.handle.net/1969.1/ETD-TAMU-2012-05-10770

start page

• 1662

end page

• 1666

volume

• 1