DeepAI AI Chat
Log In Sign Up

Joint Source-Channel Coding for the Multiple-Access Channel with Correlated Sources

by   Arezou Rezazadeh, et al.

This paper studies the random-coding exponent of joint source-channel coding for the multiple-access channel with correlated sources. For each user, by defining a threshold, the messages of each source are partitioned into two classes. The achievable exponent for correlated sources with two message-dependent input distributions for each user is determined and shown to be larger than that achieved using only one input distribution for each user. A system of equations is presented to determine the optimal thresholds maximizing the achievable exponent. The obtained exponent is compared with the one derived for the MAC with independent sources.


page 1

page 2

page 3

page 4


Multiple-Access Channel with Independent Sources: Error Exponent Analysis

In this paper, an achievable error exponent for the multiple-access chan...

Structured Mappings and Conferencing Common Information for Multiple-access Channels

In this work, we study two problems: three-user Multiple-Access Channel ...

Trellis Code Error Exponent From Results for Asynchronous Multiple Access Channels

An asynchronous multiple access error exponent result implicates a new r...

Universal Decoding for Asynchronous Slepian-Wolf Encoding

We consider the problem of (almost) lossless source coding of two correl...

Noisy Guesses

We consider the problem of guessing a random, finite-alphabet, secret n-...

Equating the achievable exponent region to the achievable entropy region by partitioning the source

In this paper we investigate the image size characterization problem. We...