Non-Asymptotic Achievability Bounds in Multiuser Information Theory

被引：0

作者：

Verdue, Sergio ^{[1
]}

机构：

[1] Princeton Univ, Princeton, NJ 08544 USA

来源：

2012 50TH ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING (ALLERTON) | 2012年

关键词：

Shannon theory; achievability; finite blocklength regime; random coding; multiple-access channels; Wyner-Ziv compression; broadcast channels; data transmission with encoder side information; almost-lossless compression with a helper; RATE-DISTORTION FUNCTION; SIDE INFORMATION; COMPRESSION;

D O I：

暂无

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

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.

引用

页码：1 / 8

页数：8

共 23 条

[1] SOURCE CODING WITH SIDE INFORMATION AND A CONVERSE FOR DEGRADED BROADCAST CHANNELS [J].