2010/01/15 by Nan Ma, Ma, Nan, Prakash Ishwar +1 · 1 citation
Computer Science · Engineering · Mathematics · #Energy Harvesting in Wireless Networks #FOS: Computer and information sciences #Information Theory (cs.IT) #Sparse and Compressive Sensing Techniques #Wireless Communication Security Techniques #cs.IT #math.IT
paper · pdf · doi:10.48550/arxiv.1001.2781
5 pages, submitted to IEEE International Symposium on Information Theory (ISIT) 2010
openalex publication_date 2010/01/15 · arxiv created 2010/06/01 · arxiv updated 2010/06/02 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In 1985 Kaspi provided a single-letter characterization of the sum-rate-distortion function for a two-way lossy source coding problem in which two terminals send multiple messages back and forth with the goal of reproducing each other's sources. Yet, the question remained whether more messages can strictly improve the sum-rate-distortion function. Viewing the sum-rate as a functional of the distortions and the joint source distribution and leveraging its convex-geometric properties, we construct an example which shows that two messages can strictly improve the one-message (Wyner-Ziv) rate-distortion function. The example also shows that the ratio of the one-message rate to the two-message sum-rate can be arbitrarily large and simultaneously the ratio of the backward rate to the forward rate in the two-message sum-rate can be arbitrarily small.