AI Chat AI Image Generator AI Video Text to Speech

Channel Codes for Relayless Networks with General Message Access Structure

06/01/2022

∙

by Jun Muramatsu, et al.

∙

∙

Channel codes for relayless networks with the general message access structure is introduced. It is shown that the multi-letter characterized capacity region of this network is achievable with this code. The capacity region is characterized in terms of entropy functions and provides an alternative to the regions introduced by [Somekh-Baruch and Verdú, ISIT2006][Muramatsu and Miyake, ISITA2018].

page 1

page 2

page 3

page 4

research

∙ 01/09/2018

Multi-Terminal Codes Using Constrained-Random-Number Generators

A general multi-terminal source code and a general multi-terminal channe...

0 Jun Muramatsu, et al. ∙

research

∙ 01/28/2021

Beyond Capacity: The Joint Time-Rate Region

The traditional notion of capacity studied in the context of memoryless ...

0 Michael Langberg, et al. ∙

research

∙ 01/11/2018

Universal random codes: Capacity regions of the compound quantum multiple-access channel with one classical and one quantum sender

We consider the compound memoryless quantum multiple-access channel (QMA...

0 Holger Boche, et al. ∙

research

∙ 05/10/2023

Entropy Functions on Two-Dimensional Faces of Polymatroidal Region of Degree Four

In this paper, we characterize entropy functions on the 2-dimensional fa...

0 Shaocheng Liu, et al. ∙

research

∙ 04/26/2019

Byzantine Multiple Access

We study communication over multiple access channels (MAC) where one of ...

0 Neha Sangwan, et al. ∙

research

∙ 06/13/2023

Competitive Channel-Capacity

We consider communication over channels whose statistics are not known i...

0 Michael Langberg, et al. ∙

research

∙ 01/11/2020

Decentralized sequential active hypothesis testing and the MAC feedback capacity

We consider the problem of decentralized sequential active hypothesis te...

0 Achilleas Anastasopoulos, et al. ∙