A Generalization of the DMC

09/21/2022
by   Sergey Tridenski, et al.
0

We consider a generalization of the discrete memoryless channel, in which the channel probability distribution is replaced by a uniform distribution over clouds of channel output sequences. For a random ensemble of such channels, we derive an achievable error exponent, as well as its converse together with the optimal correct-decoding exponent, all as functions of information rate. As a corollary of these results, we obtain the channel ensemble capacity.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/16/2020

Proof of Convergence for Correct-Decoding Exponent Computation

For a discrete memoryless channel with finite input and output alphabets...
research
08/23/2021

Decoding Error Probability of the Random Matrix Ensemble over the Erasure Channel

Using tools developed in a recent work by Shen and the second author, in...
research
10/01/2019

Noisy Guesses

We consider the problem of guessing a random, finite-alphabet, secret n-...
research
12/04/2020

Capacity of a lossy photon channel with direct detection

We calculate numerically the capacity of a lossy photon channel assuming...
research
02/14/2023

A rate of convergence when generating stable invariant Hermitian random matrix ensembles

Recently, we have classified Hermitian random matrix ensembles that are ...
research
05/29/2018

Multiple-Access Channel with Independent Sources: Error Exponent Analysis

In this paper, an achievable error exponent for the multiple-access chan...
research
02/02/2022

On Joint Communication and Channel Discrimination

We consider a basic communication and sensing setup comprising a transmi...

Please sign up or login with your details

Forgot password? Click here to reset