Universal coding for correlated sources with complementary delivery

TL;DR

This paper introduces universal coding schemes for a multiterminal source system called complementary delivery, where two correlated sources are jointly encoded and each decoder reconstructs the other message, with analyses of error bounds.

Contribution

It provides explicit constructions of universal codes and error probability bounds for the complementary delivery coding system, expanding multiterminal source coding theory.

Findings

Universal codes are explicitly constructed for the system.

Error bounds are derived using type-theoretical and graph-theoretical methods.

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

Abstract

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 graphs