University of Cambridge > Talks.cam > Communications Research Group Seminar > Mismatched Decoding

Mismatched Decoding

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Jossy Sayir.

Shannon’s channel coding theorem gives the largest rate under which, by suitable choice of the block length and decoding rule, the error probability can be made arbitrarily small. In practice, many decoders are ruled out due to complexity and imperfect knowledge of the channel. An open problem in information theory is to find the largest achievable rate for a given (possibly supoptimal) decoding rule. This is known as the mismatched decoding problem. In this talk, we present an overview of the mismatched decoding literature, with a focus on random coding and achievable rates. We then discuss ongoing work on the topic.

This talk is part of the Communications Research Group Seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2019 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity