Broadcast channels with arbitrarily correlated sources
IEEE Transactions on Information Theory
Reliable transmission of two correlated sources over an asymmetric multiple-access channel
IEEE Transactions on Information Theory
Elements of information theory
Elements of information theory
Information Theory and Reliable Communication
Information Theory and Reliable Communication
Information Theory: Coding Theorems for Discrete Memoryless Systems
Information Theory: Coding Theorems for Discrete Memoryless Systems
Information-Spectrum Characterization of Multiple-Access Channels with Correlated Sources
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
A new universal random coding bound for the multiple-access channel
IEEE Transactions on Information Theory
Tradeoff between source and channel coding
IEEE Transactions on Information Theory
The method of types [information theory]
IEEE Transactions on Information Theory
On the joint source-channel coding error exponent for discrete memoryless systems
IEEE Transactions on Information Theory
Achievable rates in cognitive radio channels
IEEE Transactions on Information Theory
A Graph-Based Framework for Transmission of Correlated Sources Over Multiple-Access Channels
IEEE Transactions on Information Theory
Joint Source–Channel Coding Error Exponent for Discrete Communication Systems With Markovian Memory
IEEE Transactions on Information Theory
A Graph-Based Framework for Transmission of Correlated Sources Over Broadcast Channels
IEEE Transactions on Information Theory
Limits on communications in a cognitive radio channel
IEEE Communications Magazine
The software radio architecture
IEEE Communications Magazine
Information Theoretic Security
Foundations and Trends in Communications and Information Theory
| Hi-index | 754.84 |
We study the transmission of two discrete memoryless correlated sources, consisting of a common and a private source, over a discrete memoryless multiterminal channel with two transmitters and two receivers. At the transmitter side, the common source is observed by both encoders but the private source can only be accessed by one encoder. At the receiver side, both decoders need to reconstruct the common source, but only one decoder needs to reconstruct the private source. We hence refer to this system by the asymmetric two-user source-channel coding system. We derive a universally achievable lossless joint source-channel coding (JSCC) error exponent pair for the two-user system by using a technique which generalizes Csiszár's type-packing lemma (1980) for the point-to-point (single-user) discrete memoryless source-channel system. We next investigate the largest convergence rate of asymptotic exponential decay of the system (overall) probability of erroneous transmission, i.e., the system JSCC error exponent. We obtain lower and upper bounds for the exponent. As a consequence, we establish a JSCC theorem with single-letter characterization and we show that the separation principle holds for the asymmetric two-user scenario. By introducing common randomization, we also provide a formula for the tandem (separate) source-channel coding error exponent. Numerical examples show that for a large class of systems consisting of two correlated sources and an asymmetric multiple-access channel with additive noise, the JSCC error exponent considerably outperforms the corresponding tandem coding error exponent.