A Second-Order Converse Bound for the Multiple-Access Channel via Wringing Dependence

07/30/2020
by   Oliver Kosut, et al.
0

A new converse bound is presented for the two-user multiple-access channel under the average probability of error constraint. This bound shows that for most channels of interest, the second-order coding rate—that is, the difference between the best achievable rates and the asymptotic capacity region as a function of blocklength n with fixed probability of error—is O(1/√(n)) bits per channel use. The principal tool behind this converse proof is a new measure of dependence between two random variables called wringing dependence, as it is inspired by Ahlswede's wringing technique. The O(1/√(n)) gap is shown to hold for any channel satisfying certain regularity conditions, which includes all discrete-memoryless channels and the Gaussian multiple-access channel. Exact upper bounds as a function of the probability of error are proved for the coefficient in the O(1/√(n)) term, although for most channels they do not match existing achievable bounds.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

11/23/2018

Sum-Rate Capacity for Symmetric Gaussian Multiple Access Channels with Feedback

The feedback sum-rate capacity is established for the symmetric J-user G...
11/20/2020

On Error Exponents of Encoder-Assisted Communication Systems

We consider a point-to-point communication system, where in addition to ...
09/16/2021

Gaussian Broadcast Channels in Heterogeneous Blocklength Constrained Networks

Future wireless access networks will support simultaneously a large numb...
08/29/2019

On exact asymptotics of the error probability in channel coding: symmetric channels

The exact order of the optimal sub-exponentially decaying factor in the ...
12/10/2018

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

We introduce a fundamental lemma called the Poisson matching lemma, and ...
05/08/2018

Non-Asymptotic Achievable Rates for Gaussian Energy-Harvesting Channels: Best-Effort and Save-and-Transmit

An additive white Gaussian noise (AWGN) energy-harvesting (EH) channel i...
01/12/2020

Gaussian Multiple and Random Access in the Finite Blocklength Regime

This paper presents finite-blocklength achievability bounds for the Gaus...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.