Gaussian multiple and random access channels: Finite-blocklength analysis
This paper presents finite-blocklength achievability bounds for the Gaussian multiple access
channel (MAC) and random access channel (RAC) under average-error and maximal-power …
channel (MAC) and random access channel (RAC) under average-error and maximal-power …
Strong converse using change of measure arguments
The strong converse for a coding theorem shows that the optimal asymptotic rate possible
with vanishing error cannot be improved by allowing a fixed error. Building on a method …
with vanishing error cannot be improved by allowing a fixed error. Building on a method …
On Strong Converse Theorems for Quantum Hypothesis Testing and Channel Coding
HC Cheng, L Gao - arxiv preprint arxiv:2403.13584, 2024 - arxiv.org
Strong converse theorems refer to the study of impossibility results in information theory. In
particular, Mosonyi and Ogawa established a one-shot strong converse bound for quantum …
particular, Mosonyi and Ogawa established a one-shot strong converse bound for quantum …
Random access channel coding in the finite blocklength regime
Consider a random access communication scenario over a channel whose operation is
defined for any number of possible transmitters. As in the model recently introduced by …
defined for any number of possible transmitters. As in the model recently introduced by …
Strong converses using change of measure and asymptotic Markov chains
The main contribution of this paper is a strong converse result for K-hop distributed
hypothesis testing against independence with multiple (intermediate) decision centers under …
hypothesis testing against independence with multiple (intermediate) decision centers under …
On Gaussian channels with feedback under expected power constraints and with non-vanishing error probabilities
In this paper, we consider single-and multi-user Gaussian channels with feedback under
expected power constraints and with non-vanishing error probabilities. In the first of two …
expected power constraints and with non-vanishing error probabilities. In the first of two …
On Gaussian MACs with variable-length feedback and non-vanishing error probabilities
We characterize the fundamental limits of transmission of information over a Gaussian
multiple access channel (MAC) with the use of variable-length feedback codes and under a …
multiple access channel (MAC) with the use of variable-length feedback codes and under a …
A second-order converse bound for the multiple-access channel via wringing dependence
O Kosut - IEEE Transactions on Information Theory, 2022 - ieeexplore.ieee.org
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 …
average probability of error constraint. This bound shows that for most channels of interest …
Strong converses using typical changes of measures and asymptotic Markov chains
The paper presents exponentially-strong converses for source-coding, channel coding, and
hypothesis testing problems. More specifically, it presents alternative proofs for the well …
hypothesis testing problems. More specifically, it presents alternative proofs for the well …
Gaussian multiple and random access in the finite blocklength regime
This paper presents finite-blocklength achievability bounds for the Gaussian multiple access
channel (MAC) and random access channel (RAC) under average-error and maximal-power …
channel (MAC) and random access channel (RAC) under average-error and maximal-power …