Universal source coding over generalized complementary delivery networks

Authors:
Akisato Kimura;Tomohiko Uyematsu;Shigeaki Kuzuoka;Shun Watanabe
Affiliations:
NTT Communication Science Laboratories, NTT Corporation, Atsugi, Kanagawa, Japan;Department of Communications and Integrated Systems, Tokyo Institute of Technology, Meguro, Tokyo, Japan;Department of Computer and Communication Sciences, Wakayama University, Wakayama, Japan;Department of Communications and Integrated Systems, Tokyo Institute of Technology, Meguro, Tokyo, Japan
Venue:
IEEE Transactions on Information Theory
Year:
2009

Citing 11
Cited 0

Information Theory: Coding Theorems for Discrete Memoryless Systems

Information Theory: Coding Theorems for Discrete Memoryless Systems
Separating distributed source coding from network coding

IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Universal Coding for Correlated Sources with Complementary Delivery

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Universal coding for correlated sources with linked encoders

IEEE Transactions on Information Theory
Network information flow

IEEE Transactions on Information Theory
An algebraic construction of codes for Slepian-Wolf source networks

IEEE Transactions on Information Theory
Communicating via a processing broadcast satellite

IEEE Transactions on Information Theory
Linear network coding

IEEE Transactions on Information Theory
Networked Slepian-Wolf: theory, algorithms, and scaling laws

IEEE Transactions on Information Theory
Network information flow with correlated sources

IEEE Transactions on Information Theory
A Random Linear Network Coding Approach to Multicast

IEEE Transactions on Information Theory

Quantified Score

Hi-index	754.84

Visualization

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.