Consider the important special case of the K-user distributedsourcecoding problem where the decoder only wishes to recover one or more linear combinations of the sources. The work of Korner and Marton demonstrated t...
详细信息
ISBN:
(纸本)9781538692912
Consider the important special case of the K-user distributedsourcecoding problem where the decoder only wishes to recover one or more linear combinations of the sources. The work of Korner and Marton demonstrated that, in some cases, the optimal rate region is attained by random linear codes, and strictly improves upon the best-known achievable rate region established via random i.i.d. codes. Recent efforts have sought to develop a framework for characterizing the achievable rate region for nested linear codes via joint typicality encoding and decoding. Here, we make further progress along this direction by proposing an achievable rate region for simultaneous joint typicality decoding of nested linear codes. Our approach generalizes the results of Korner and Marton to computing an arbitrary number of linear combinations and to the lossy computation setting.
Consider a multi-source multicast network coding problem with correlated sources. While the fundamental limits are known, achieving them, in general, involves a computational burden due to the complex decoding process...
详细信息
ISBN:
(纸本)9784885523090
Consider a multi-source multicast network coding problem with correlated sources. While the fundamental limits are known, achieving them, in general, involves a computational burden due to the complex decoding process. Efficient solutions, on the other hand, are by large based on source and network coding separation, thus imposing strict topological constraints on the networks which can be solved. In this work, we introduce a novel notion of separation of source and network coding using Gacs-Korner Common Information (CI). Unlike existing notions of separation, the sufficient condition for this separation to hold depends on the source structure rather than the network topology. Using the suggested separation scheme, we tackle the problem of multi-source multicast. We construct efficient, zero error source codes, and via properties of the CI completely characterize the resulting rate region. We then study the complexity of the end-to-end scheme.
暂无评论