Multi-Terminal Codes Using Constrained-Random-Number Generators

2018/01/09 by Muramatsu, Jun, Miyake, Shigeki
#FOS: Computer and information sciences #Information Theory (cs.IT)

paper · doi:10.48550/arxiv.1801.02875

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ú, ISIT2006].

Related

• Distributed Source Coding, Multiple Description Coding, and Source Coding with Side Information at Decoders Using Constrained-Random Number Generators
• Construction of a Channel Code from an Arbitrary Source Code with Decoder Side Information
• Distributed Source Coding Using Constrained-Random-Number Generators
• Sparse Regression Codes for Multi-terminal Source and Channel Coding
• Channel Coding: The Road to Channel Capacity