Less noisy domination by symmetric channels
Consider the family of all q-ary symmetric channels (q-SCs) with capacities decreasing from log(q) to 0. This paper addresses the following question: what is the member of this family with the smallest capacity that dominates a given channel V in the 'less noisy' preorder sense. When the q...
Main Authors: | Makur, Anuran, Polyanskiy, Yury |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
Format: | Article |
Language: | English |
Published: |
IEEE
2019
|
Online Access: | https://hdl.handle.net/1721.1/121869 |
Similar Items
-
Comparison of channels: criteria for domination by a symmetric channel
by: Makur, Anuran, et al.
Published: (2020) -
Broadcasting on Random Directed Acyclic Graphs
by: Makur, Anuran, et al.
Published: (2021) -
Broadcasting on Random Networks
by: Makur, Anuran, et al.
Published: (2021) -
Broadcasting on Random Networks
by: Makur, Anuran, et al.
Published: (2021) -
Reconstruction on 2D Regular Grids
by: Makur, Anuran, et al.
Published: (2022)