Simpler Achievable Rate Regions for Multiaccess With Finite Blocklength

Provided by: Institute of Electrical & Electronic Engineers
Topic: Mobility
Format: PDF
Although practical communication networks employ coding schemes with block-lengths as low as several hundred symbols, classical information theoretic setups consider block-lengths approaching infinity. Building upon information spectrum concepts and recent work on channel dispersion, the authors develop a non-asymptotic inner bound on as well as a low-complexity, second-order achievable rate region for a discrete memoryless multiple access channel with a given finite block-length and positive average error probability. Their bounds appear to capture essentially the same region as those of Tan and Kosut, but are less computationally complex because they require only the means and variances of the relevant mutual information random variables instead of their full covariance matrix.

Find By Topic