2000 character limit reached
Universal Coding of Ergodic Sources for Multiple Decoders with Side Information
Published 19 Apr 2010 in cs.IT and math.IT | (1004.3085v1)
Abstract: A multiterminal lossy coding problem, which includes various problems such as the Wyner-Ziv problem and the complementary delivery problem as special cases, is considered. It is shown that any point in the achievable rate-distortion region can be attained even if the source statistics are not known.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
