论文标题
两端源编码，具有共同的总和重建
Two-terminal source coding with common sum reconstruction
论文作者
论文摘要
我们提出了具有共同总和重建（CSR）的两端源编码的问题。考虑两个终端，每个终端都可以访问两个相关源之一。两个终端都想在某些平均变形约束下重建两个源的总和，并且两个终端处的重建必须具有很高的概率。在本文中，我们将内部和外部边界开发到双重对称二进制源的CSR问题的可达到的速率失真区域。我们对Steinberg的常见重建和Wyner-Ziv的源编码进行了现有的可实现结果，并为Korner-Marton的Modulo-Two-two总计计算问题提供了可实现的结果。
We present the problem of two-terminal source coding with Common Sum Reconstruction (CSR). Consider two terminals, each with access to one of two correlated sources. Both terminals want to reconstruct the sum of the two sources under some average distortion constraint, and the reconstructions at two terminals must be identical with high probability. In this paper, we develop inner and outer bounds to the achievable rate distortion region of the CSR problem for a doubly symmetric binary source. We employ existing achievability results for Steinberg's common reconstruction and Wyner-Ziv's source coding with side information problems, and an achievability result for the lossy version of Korner-Marton's modulo-two sum computation problem.
