A Generalization of the DMC
Sergey Tridenski, Anelia Somekh-Baruch

TL;DR
This paper extends the discrete memoryless channel model by introducing a cloud-based output distribution, deriving error exponents, capacity, and bounds for this generalized channel ensemble.
Contribution
It presents a novel generalization of the DMC with a cloud-based output distribution and derives fundamental limits like error exponents and capacity for this model.
Findings
Derived achievable error exponent for the generalized channel
Established converse bounds and optimal decoding exponents
Obtained the capacity of the channel ensemble
Abstract
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDNA and Biological Computing · Cooperative Communication and Network Coding · Cellular Automata and Applications
