Multi-Terminal Codes Using Constrained-Random-Number Generators

TL;DR

This paper introduces a unified approach for multi-terminal source and channel coding using constrained-random-number generators with sparse matrices, deriving achievable regions based on entropy functions.

Contribution

It presents a general framework for multi-terminal coding schemes utilizing constrained-random-number generators, offering new achievable regions and an alternative capacity region formulation.

Findings

Derived achievable regions for source and channel coding.

Introduced a coding scheme using constrained-random-number generators with sparse matrices.

Provided an alternative characterization of the channel capacity region.

Abstract

A general multi-terminal source code and a general multi-terminal channel code are presented. Constrained-random-number generators with sparse matrices, which are building blocks for the code construction, are used in the construction of both encoders and decoders. Achievable regions for source coding and channel coding are derived in terms of entropy functions, where the capacity region for channel coding provides an alternative to the region of [Somekh-Baruch and Verd\'u, ISIT2006].