Our next meeting in the Information Theory and Applications seminar will take place on Monday, June 17 at 10:00, in room A500.

The speaker is Anelia Somekh-Baruch, who will tell us about an exciting new technique for proving impossibility results for various communication setups.

See you there,

Or, Oron, Yuval and Alex

---------------------------------------------

Title:  A new framework for proving converse theorems for channel coding

Abstract: The problem of determining the fundamental limits of channel coding in the case of sub-optimal decoding, also known as "mismatched decoding," is a longstanding question that has numerous applications in fields such as communications, information theory, and computer science. For instance, the zero-error capacity of a channel is a special example of a mismatched channel coding scenario. In this talk, I will provide an overview of this problem and introduce a new bounding technique called the "multicasting approach." This approach yields multiple single-letter converse (impossibility) bounds for stationary memoryless channels that are non-trivial. Additionally, I will discuss how refining this method leads to state-of-the-art converse bounds on the reliability function (error exponent) for channel coding of discrete memoryless channels with maximum-likelihood decoding.