Pierre Moulin, UIUC, USA

Title: Finite Blocklength Capacity Region for Multiple Access Channels

Abstract:
This talk presents the problem of finding maximum achievable rate regions for codes of a given blocklength n and desired error probability ε, over multiple access channels. Single-letter expressions for an inner region and an outer region are derived. These regions tend to the classical pentagonal capacity region of Ahlswede and Liao, at the rate 1/√n. This is joint work with Yen-Wei Huang.