Universal source coding over generalized complementary delivery networks
Information Theory
2009-04-02 v1 math.IT
Abstract
This paper deals with a universal coding problem for a certain kind of multiterminal source coding network called a generalized complementary delivery network. In this network, messages from multiple correlated sources are jointly encoded, and each decoder has access to some of the messages to enable it to reproduce the other messages. Both fixed-to-fixed length and fixed-to-variable length lossless coding schemes are considered. Explicit constructions of universal codes and the bounds of the error probabilities are clarified by using methods of types and graph-theoretical analysis.
Cite
@article{arxiv.0710.4987,
title = {Universal source coding over generalized complementary delivery networks},
author = {Akisato Kimura and Tomohiko Uyematsu and Shigeaki Kuzuoka and Shun Watanabe},
journal= {arXiv preprint arXiv:0710.4987},
year = {2009}
}
Comments
18 pages, one column, submitted to IEEE Transactions on Information Theory, presented at a recent result session in ISIT2007