37 research outputs found
On networks with side information
In this paper, we generalize the lossless coded side
information problem from the three-node network of Ahlswede
and K¨orner to more general network scenarios. We derive
inner and outer bounds on the achievable rate region in the
general network scenario and show that they are tight for some
families of networks. Our approach demonstrates how solutions
to canonical source coding problems can be used to derive bounds
for more complex networks and reveals an interesting connection
between networks with side information, successive refinement,
and network coding
Universal coding for correlated sources with complementary delivery
This paper deals with a universal coding problem for a certain kind of
multiterminal source coding system that we call the complementary delivery
coding system. In this system, messages from two correlated sources are jointly
encoded, and each decoder has access to one of the two messages to enable it to
reproduce the other message. Both fixed-to-fixed length and fixed-to-variable
length lossless coding schemes are considered. Explicit constructions of
universal codes and bounds of the error probabilities are clarified via
type-theoretical and graph-theoretical analyses. [[Keywords]] multiterminal
source coding, complementary delivery, universal coding, types of sequences,
bipartite graphsComment: 18 pages, some of the material in this manuscript has been already
published in IEICE Transactions on Fundamentals, September 2007. Several
additional results are also include