Non-asymptotic achievability bounds in multiuser information theory

Sergio Verdu

doi:10.1109/Allerton.2012.6483192

Non-asymptotic achievability bounds in multiuser information theory

Sergio Verdu

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

56 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 language	English (US)
Title of host publication	2012 50th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2012
Pages	1-8
Number of pages	8
DOIs	https://doi.org/10.1109/Allerton.2012.6483192
State	Published - 2012
Event	2012 50th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2012 - Monticello, IL, United States Duration: Oct 1 2012 → Oct 5 2012

Publication series

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

Other

Other	2012 50th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2012
Country/Territory	United States
City	Monticello, IL
Period	10/1/12 → 10/5/12

All Science Journal Classification (ASJC) codes

Computer Networks and Communications
Computer Science Applications

Keywords

Shannon theory
Wyner-Ziv compression
achievability
almost-lossless compression with a helper
broadcast channels
data transmission with encoder side information
finite blocklength regime
multiple-access channels
random coding

Access to Document

10.1109/Allerton.2012.6483192

Cite this

@inproceedings{720e7c2c7b024b8ebf2829a9cfd1d65e,

title = "Non-asymptotic achievability bounds in multiuser information theory",

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.",

keywords = "Shannon theory, Wyner-Ziv compression, achievability, almost-lossless compression with a helper, broadcast channels, data transmission with encoder side information, finite blocklength regime, multiple-access channels, random coding",

author = "Sergio Verdu",

year = "2012",

doi = "10.1109/Allerton.2012.6483192",

language = "English (US)",

isbn = "9781467345385",

series = "2012 50th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2012",

pages = "1--8",

booktitle = "2012 50th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2012",

note = "2012 50th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2012 ; Conference date: 01-10-2012 Through 05-10-2012",

}

Verdu, S 2012, Non-asymptotic achievability bounds in multiuser information theory. in 2012 50th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2012., 6483192, 2012 50th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2012, pp. 1-8, 2012 50th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2012, Monticello, IL, United States, 10/1/12. https://doi.org/10.1109/Allerton.2012.6483192

Non-asymptotic achievability bounds in multiuser information theory. / Verdu, Sergio.
2012 50th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2012. 2012. p. 1-8 6483192 (2012 50th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2012).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - Non-asymptotic achievability bounds in multiuser information theory

AU - Verdu, Sergio

PY - 2012

Y1 - 2012

N2 - 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.

AB - 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.

KW - Shannon theory

KW - Wyner-Ziv compression

KW - achievability

KW - almost-lossless compression with a helper

KW - broadcast channels

KW - data transmission with encoder side information

KW - finite blocklength regime

KW - multiple-access channels

KW - random coding

UR - http://www.scopus.com/inward/record.url?scp=84875713712&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84875713712&partnerID=8YFLogxK

U2 - 10.1109/Allerton.2012.6483192

DO - 10.1109/Allerton.2012.6483192

M3 - Conference contribution

AN - SCOPUS:84875713712

SN - 9781467345385

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

SP - 1

EP - 8

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

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

Y2 - 1 October 2012 through 5 October 2012

ER -

Non-asymptotic achievability bounds in multiuser information theory

Abstract

Publication series

Other

All Science Journal Classification (ASJC) codes

Keywords

Access to Document

Other files and links

Fingerprint

Cite this