CCSP Seminar: Anelia Somekh-Baruch, "A Single-Letter Upper Bound on the Mismatch Capacity"

Thursday, March 25, 2021
12:30 p.m.
Online presentation
Zitan Chen
chenztan@umd.edu

Communication, Control and Signal Processing Seminar

A Single-Letter Upper Bound on the Mismatch Capacity

Anelia Somekh-Baruch
Bar-Ilan University

Zoom link: https://umd.zoom.us/j/99545688468


Abstract
The question of finding a single-letter formula for the mismatch capacity, which is the supremum of achievable rates of reliable communication when the receiver uses a sub-optimal decoding rule, has been a long standing open problem. This question has many applications in communications, Information-Theory, and Computer Science. For example, the zero-error capacity of a channel is a special case of mismatch capacity.

In this talk, I will give a brief overview of the problem, and introduce a new bounding technique called the "multicasting approach", which straightforwardly yields single-letter upper bounds on the mismatch capacity of stationary memoryless channels. I will also present equivalence classes of isomorphic channel-metric pairs that share the same mismatch capacity, and a sufficient condition for the tightness of the bound for the entire equivalence class.

 

Audience: Graduate  Undergraduate  Faculty  Post-Docs 

remind we with google calendar

 

April 2021

SU MO TU WE TH FR SA
28 29 30 31 1 2 3
4 5 6 7 8 9 10
11 12 13 14 15 16 17
18 19 20 21 22 23 24
25 26 27 28 29 30 1
Submit an Event