Random Access and Source-Channel Coding Error Exponents for Multiple Access Channels

Farkas, Lóránt; Koi, Tams

doi:10.1109/tit.2015.2428254

Cited by 8 publications

(2 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Next, we have the message-dependent iid ( md-iid ) ensemble [ 6 , 8 , 19 , 25 , 28 ], where codewords for each user are generated with i. i. d. symbols according to different distributions

that depend on the full source message through the class index

of the class the source message belongs to. More precisely, for user

with source marginal distribution

, the

-th class

, where

, is defined as the set of all source messages whose probability

is within a given interval, that is,

where the thresholds

are

non-negative numbers, ordered from higher to lower, such that

, and

and

.…”

Section: Multi-class Cost-constrained Ensemble With Statistical Dependencymentioning

confidence: 99%

See 1 more Smart Citation

Multi-Class Cost-Constrained Random Coding for Correlated Sources over the Multiple-Access Channel

Rezazadeh

Font-Segura

Martinez

et al. 2021

Entropy

View full text Add to dashboard Cite

This paper studies a generalized version of multi-class cost-constrained random-coding ensemble with multiple auxiliary costs for the transmission of N correlated sources over an N-user multiple-access channel. For each user, the set of messages is partitioned into classes and codebooks are generated according to a distribution depending on the class index of the source message and under the constraint that the codewords satisfy a set of cost functions. Proper choices of the cost functions recover different coding schemes including message-dependent and message-independent versions of independent and identically distributed, independent conditionally distributed, constant-composition and conditional constant composition ensembles. The transmissibility region of the scheme is related to the Cover-El Gamal-Salehi region. A related family of correlated-source Gallager source exponent functions is also studied. The achievable exponents are compared for correlated and independent sources, both numerically and analytically.

show abstract

“…Next, we have the message-dependent iid ( md-iid ) ensemble [ 6 , 8 , 19 , 25 , 28 ], where codewords for each user are generated with i. i. d. symbols according to different distributions

that depend on the full source message through the class index

of the class the source message belongs to. More precisely, for user

with source marginal distribution

, the

-th class

, where

, is defined as the set of all source messages whose probability

is within a given interval, that is,

where the thresholds

are

non-negative numbers, ordered from higher to lower, such that

, and

and

.…”

Section: Multi-class Cost-constrained Ensemble With Statistical Dependencymentioning

confidence: 99%

“…For the MAC with independent sources, the idea of exploting the dependency between messages and codewords was studied in ref. [ 19 ]. In ref.…”

Section: Introductionmentioning

confidence: 99%

Multi-Class Cost-Constrained Random Coding for Correlated Sources over the Multiple-Access Channel

Rezazadeh

Font-Segura

Martinez

et al. 2021

Entropy

View full text Add to dashboard Cite

show abstract

Universal random access error exponents for codebooks with different word-lengths

Farkas¹,

Kói²

2017

2017 IEEE International Symposium on Information Theory (ISIT)

Self Cite

View full text Add to dashboard Cite

Csiszár's channel coding theorem for multiple codebooks is generalized allowing the codeword lenghts differ across codebooks. Also in this case, for each codebook an error exponent can be achieved that equals the random coding exponent for this codebook alone, in addition, erasure detection failure probability tends to 0. This is proved even for sender and receiver not knowing the channel. As a corollary, a substantial improvement is obtained when the sender knows the channel.

show abstract

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

Rezazadeh

Font-Segura

Martinez

et al. 2019

2019 IEEE International Symposium on Information Theory (ISIT)

View full text Add to dashboard Cite

This paper studies the random-coding exponent of joint source-channel coding for the multipleaccess 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 messagedependent 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.

show abstract

Random Access and Source-Channel Coding Error Exponents for Multiple Access Channels

Cited by 8 publications

References 18 publications

Multi-Class Cost-Constrained Random Coding for Correlated Sources over the Multiple-Access Channel

Multi-Class Cost-Constrained Random Coding for Correlated Sources over the Multiple-Access Channel

Universal random access error exponents for codebooks with different word-lengths

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

Contact Info

Product

Resources

About