Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
We consider multiple description source coding problem with Gaussian source and mean squared error, for descriptions. We obtain an outer bound for the rate region of the problem. We also derive an inner bound for the problem based on successively refineability of the Gaussian source and multi-level diversity coding. Our gap analysis shows that the difference between two bounds is less than bits, in the worst case.