Coding schemes for several problems in network information theory are constructed starting from point-to-point channel codes that are designed for symmetric channels. Given that the point-to-point codes satisfy certain properties pertaining to the rate, the error probability, and the distribution of decoded sequences, bounds on the performance of the coding schemes are derived and shown to hold irrespective of other properties of the codes. In particular, we consider the problems of lossless and lossy source coding, Slepian-Wolf coding, Wyner-Ziv coding, Berger-Tung coding, multiple description coding, asymmetric channel coding, Gelfand-Pinsker coding, coding for multiple access channels, Marton coding for broadcast channels, and coding for cloud radio access networks (C-RAN's). We show that the coding schemes can achieve the best known inner bounds for these problems, provided that the constituent point-to-point channel codes are rate-optimal. This would allow one to leverage commercial off-the-shelf codes for point-to-point symmetric channels in the practical implementation of codes over networks. Simulation results demonstrate the gain of the proposed coding schemes compared to existing practical solutions to these problems.

翻译：针对网络信息论中的若干问题，本文从为对称信道设计的点对点信道码出发构建编码方案。在满足码率、错误概率及译码序列分布等特定性质的前提下，推导了这些编码方案的性能界，并证明这些界与码的其他性质无关。具体研究了无损与有损信源编码、Slepian-Wolf编码、Wyner-Ziv编码、Berger-Tung编码、多描述编码、非对称信道编码、Gelfand-Pinsker编码、多址信道编码、广播信道的Marton编码以及云无线接入网络（C-RAN）编码等问题。研究表明，当构成编码方案的点对点信道码达到最优码率时，该方案可取得这些问题的已知最佳内界。这使得在实际网络编码实现中，能够利用商业现成的点对点对称信道码。仿真结果验证了所提编码方案相比现有实用解决方案的性能优势。