Finite blocklength coding for multiple access channels

Yen Wei Huang, Pierre Moulin

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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.

Original languageEnglish (US)
Title of host publication2012 IEEE International Symposium on Information Theory Proceedings, ISIT 2012
Pages831-835
Number of pages5
DOIs
StatePublished - 2012
Event2012 IEEE International Symposium on Information Theory, ISIT 2012 - Cambridge, MA, United States
Duration: Jul 1 2012Jul 6 2012

Publication series

NameIEEE International Symposium on Information Theory - Proceedings

Other

Other2012 IEEE International Symposium on Information Theory, ISIT 2012
Country/TerritoryUnited States
CityCambridge, MA
Period7/1/127/6/12

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Information Systems
  • Modeling and Simulation
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Finite blocklength coding for multiple access channels'. Together they form a unique fingerprint.

Cite this