Non-asymptotic achievability bounds in multiuser information theory

Sergio Verdu

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

42 Scopus citations

Abstract

Invoking random coding, but not typical sequences, we give non-asymptotic achievability results for the major setups in multiuser information theory. No limitations, such as memorylessness or discreteness, on sources/channels are imposed. All the bounds given are powerful enough to yield the constructive side of the (asymptotic) capacity regions in the memoryless case. The approach relies on simple non-asymptotic counterparts of the packing and covering lemmas conventionally used in conjunction with the typical sequence approach.

Original languageEnglish (US)
Title of host publication2012 50th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2012
Pages1-8
Number of pages8
DOIs
StatePublished - Dec 1 2012
Event2012 50th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2012 - Monticello, IL, United States
Duration: Oct 1 2012Oct 5 2012

Publication series

Name2012 50th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2012

Other

Other2012 50th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2012
CountryUnited States
CityMonticello, IL
Period10/1/1210/5/12

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Computer Science Applications

Fingerprint Dive into the research topics of 'Non-asymptotic achievability bounds in multiuser information theory'. Together they form a unique fingerprint.

  • Cite this

    Verdu, S. (2012). Non-asymptotic achievability bounds in multiuser information theory. In 2012 50th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2012 (pp. 1-8). [6483192] (2012 50th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2012). https://doi.org/10.1109/Allerton.2012.6483192