A Unified Framework for One-shot Achievability via the Poisson Matching Lemma

12/10/2018
by   Cheuk Ting Li, et al.
0

We introduce a fundamental lemma called the Poisson matching lemma, and apply it to prove one-shot achievability results for various settings, namely channels with state information at the encoder, lossy source coding with side information at the decoder, joint source-channel coding, broadcast channels, distributed lossy source coding, multiple access channels, channel resolvability and wiretap channels. Our one-shot bounds improve upon the best known one-shot bounds in most of the aforementioned settings (except multiple access channels, channel resolvability and wiretap channels, where we recover bounds comparable to the best known bounds), with shorter proofs in some settings even when compared to the conventional asymptotic approach using typicality. The Poisson matching lemma replaces both the packing and covering lemmas, greatly simplifying the error analysis. This paper extends the work of Li and El Gamal on Poisson functional representation, which mainly considered variable-length source coding settings, whereas this paper studies fixed-length settings, and is not limited to source coding, showing that the Poisson functional representation is a viable alternative to typicality for most problems in network information theory.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/14/2022

A Lego-Brick Approach to Coding for Network Communication

Coding schemes for several problems in network information theory are co...
research
02/23/2022

Lattices from Linear Codes: Source and Channel Networks

In this paper, we consider the information-theoretic characterization of...
research
11/17/2022

Distributed Deep Joint Source-Channel Coding over a Multiple Access Channel

We consider distributed image transmission over a noisy multiple access ...
research
05/24/2023

Greedy Poisson Rejection Sampling

One-shot channel simulation is a fundamental data compression problem co...
research
01/23/2018

Homologous Codes for Multiple Access Channels

Building on recent development by Padakandla and Pradhan, and by Lim, Fe...
research
09/25/2019

One-shot achievability and converse bounds of Gaussian random coding in AWGN channels under covert constraints

This paper considers the achievability and converse bounds on the maxima...
research
11/11/2020

Transmission of a Bit over a Discrete Poisson Channel with Memory

A coding scheme for transmission of a bit maps a given bit to a sequence...

Please sign up or login with your details

Forgot password? Click here to reset