![]() |
Volumn , Issue , 2012, Pages 1044-1048
|
Achievability proof via output statistics of random binning
|
Author keywords
[No Author keywords available]
|
Indexed keywords
ACHIEVABILITY;
BROADCAST CHANNELS;
CHANNEL SIMULATION;
CORRELATED SOURCES;
FINITE RATE;
LEFTOVER HASH LEMMA;
LOSSY TRANSMISSION;
LOWER BOUNDS;
MEMORYLESS;
MUTUALLY INDEPENDENTS;
NETWORK INFORMATION THEORY;
NEW RESULTS;
OR COVERINGS;
RANDOM BINNING;
RATE DISTORTIONS;
SLEPIAN-WOLF;
SUFFICIENT CONDITIONS;
UBIQUITOUS FRAMEWORK;
BROADCASTING;
INFORMATION THEORY;
PROBLEM SOLVING;
|
EID: 84867560398
PISSN: None
EISSN: None
Source Type: Conference Proceeding
DOI: 10.1109/ISIT.2012.6283010 Document Type: Conference Paper |
Times cited : (15)
|
References (12)
|