Multi-Terminal Codes Using Constrained-Random-Number Generators

01/09/2018
by   Jun Muramatsu, et al.
0

A general multi-terminal source code and a general multi-terminal channel code are presented. Constrained-random-number generators with sparse matrices, 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].

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/01/2022

Channel Codes for Relayless Networks with General Message Access Structure

Channel codes for relayless networks with the general message access str...
research
01/26/2022

On the Achievability of Interference Channel Coding

This paper investigates the achievability of the interference channel co...
research
05/08/2021

On Multi-Channel Huffman Codes for Asymmetric-Alphabet Channels

Zero-error single-channel source coding has been studied extensively ove...
research
07/07/2022

Identification based on random coding

Ahlswede and Dueck showed possibility to identify with high probability ...
research
04/25/2014

Equating the achievable exponent region to the achievable entropy region by partitioning the source

In this paper we investigate the image size characterization problem. We...
research
02/24/2020

Achievable Information Rates for Probabilistic Amplitude Shaping: A Minimum-Randomness Approach via Random Sign-Coding Arguments

Probabilistic amplitude shaping (PAS) is a coded modulation strategy in ...
research
05/21/2021

Unified Expression of Achievable Region in Privacy-Constrained Source Coding

Privacy-constrained source coding problems have become increasingly impo...

Please sign up or login with your details

Forgot password? Click here to reset