Finite blocklength coding for multiple access channels
Authors:
- 1 July 2012
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21578095,p. 831-835
Abstract
This paper studies the maximum achievable rate region of multiple access channels (MAC) for a given blocklength n and a desired error probability ϵ. The inner region for the discrete memoryless MAC is approximated by a single-lettered expression I - 1/√n Q inv (V, ϵ) where I is associated with the capacity pentagon bounds by Ahlswede and Liao, V is the MAC dispersion matrix, and Q inv is the complementary multivariate Gaussian cumulative distribution region. For outer regions, we provide general converse bounds for both average error probability and maximum error probability criteria, and a single-lettered approximation for the discrete memoryless MAC.Keywords
This publication has 4 references indexed in Scilit:
- Dispersion of the Gilbert-Elliott ChannelIEEE Transactions on Information Theory, 2011
- Finite blocklength coding for channels with side information at the receiver2010
- Channel Coding Rate in the Finite Blocklength RegimeIEEE Transactions on Information Theory, 2010
- On the dependence of the Berry–Esseen bound on dimensionJournal of Statistical Planning and Inference, 2003