On capacities of the two-user union channel with complete feedback

04/23/2018
by   Zilin Jiang, et al.
0

The exact values of the optimal symmetric rate point in the Cover--Leung capacity region of the two-user union channel with complete feedback were determined by Willems when the size of the input alphabet is 2, and by Vinck, Hoeks and Post when the size is at least 6. We complete this line of research when the size of the input alphabet is 3, 4 or 5. The proof hinges on the technical lemma that concerns the maximal joint entropy of two independent random variables in terms of their probability of equality. For the zero-error capacity region, using superposition coding, we provide a practical near-optimal communication scheme which improves all the previous explicit constructions.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/14/2022

A Feedback Capacity-Achieving Coding Scheme for the (d,∞)-RLL Input-Constrained Binary Erasure Channel

This paper considers the memoryless input-constrained binary erasure cha...
research
02/25/2023

Feedback Capacity of OU-Colored AWGN Channels

We derive an explicit feedback capacity formula for the OU-Colored AWGN ...
research
05/29/2020

An Explicit Formula for the Zero-Error Feedback Capacity of a Class of Finite-State Additive Noise Channels

It is known that for a discrete channel with correlated additive noise, ...
research
02/24/2019

Secret Key Capacity For Multipleaccess Channel With Public Feedback

We consider the generation of a secret key (SK) by the inputs and the ou...
research
08/20/2018

On the compression of messages in the multi-party setting

We consider the following communication task in the multi-party setting,...
research
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 ...
research
06/09/2021

On the Cover and Pombra Gaussian Feedback Capacity: Complete Sequential Characterizations via a Sufficient Statistic

The main objective of this paper is to derive a new sequential character...

Please sign up or login with your details

Forgot password? Click here to reset