Universal source coding over generalized complementary delivery networks

TL;DR

This paper introduces universal coding schemes for a multiterminal source network where multiple correlated sources are jointly encoded, and decoders reconstruct messages using partial information, with explicit code constructions and error bounds.

Contribution

It provides the first explicit universal coding schemes and error bounds for generalized complementary delivery networks, expanding multiterminal source coding theory.

Findings

Explicit universal codes are constructed for the network.

Error probability bounds are derived using types and graph theory.

Both fixed-length and variable-length coding schemes are analyzed.

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.