University of Cambridge > Talks.cam > Information Theory Seminar > Typical error exponents

  Browse A-Z

Log in

Cambridge users (raven)details Other usersdetails No account?details

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

Typical error exponents

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

If you have a question about this talk, please contact Dr Varun Jog.

This talk will discuss error exponents of random codes with independently generated codewords. In particular, we will introduce the random coding, expurgated and typical error exponents. By refining a simple lemma by Gallager, we show the achievability of the typical error exponent for a broad class of channels, including finite-state channels.

This talk is part of the Information Theory Seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Cambridge Global Health Year Scientific Computing Brexit as a Revolution

Other talks

Introduction In-situ visualization of AMR datasets with ParaView Catalyst and Intel OSPRay Gateway All virtue, war and honour? On the early phase of Latin literature and the evolution of a concept of play in republican Rome Cleaning up the nuclear legacy: Vitrified wasteform development and durability Contributed Talk: Rigorous and general statistical tests for correlations between time series
 

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