Error Exponents of Typical Random Codes of Source-Channel Coding

Ran Averbuch; Neri Merhav

doi:10.1109/ITW44776.2019.8989340

Error Exponents of Typical Random Codes of Source-Channel Coding

Ran Averbuch, Neri Merhav

Technion - Israel Institute of Technology

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

The error exponent of the typical random code (TRC) in a communication scenario of source-channel coding with side information at the decoder is the main objective of this work. We derive a lower bound, which is at least as large as the random binning-coding exponent due to Merhav (2016), and we show numerically that it may be strictly larger. We deduce the exponents of the TRCs in two special cases: Slepian-Wolf (SW) source coding and joint source-channel coding. Each of these models is further studied in order to provide deeper intuition concerning the behavior of the typical random code. We also propose an alternative expression for the error exponent of typical random binning in SW model, which is given by an optimization over four parameters only, instead of a computationally heavy optimization over probability distributions.

Original language	English
Title of host publication	2019 IEEE Information Theory Workshop, ITW 2019
ISBN (Electronic)	9781538669006
DOIs	https://doi.org/10.1109/ITW44776.2019.8989340
State	Published - Aug 2019
Event	2019 IEEE Information Theory Workshop, ITW 2019 - Visby, Sweden Duration: 25 Aug 2019 → 28 Aug 2019

Publication series

Name	2019 IEEE Information Theory Workshop, ITW 2019

Conference

Conference	2019 IEEE Information Theory Workshop, ITW 2019
Country/Territory	Sweden
City	Visby
Period	25/08/19 → 28/08/19

All Science Journal Classification (ASJC) codes

Software
Computational Theory and Mathematics
Computer Networks and Communications
Information Systems

Access to Document

10.1109/ITW44776.2019.8989340

Cite this

@inproceedings{3b01eaa37fed4eaba5414f01666f2b48,

title = "Error Exponents of Typical Random Codes of Source-Channel Coding",

abstract = "The error exponent of the typical random code (TRC) in a communication scenario of source-channel coding with side information at the decoder is the main objective of this work. We derive a lower bound, which is at least as large as the random binning-coding exponent due to Merhav (2016), and we show numerically that it may be strictly larger. We deduce the exponents of the TRCs in two special cases: Slepian-Wolf (SW) source coding and joint source-channel coding. Each of these models is further studied in order to provide deeper intuition concerning the behavior of the typical random code. We also propose an alternative expression for the error exponent of typical random binning in SW model, which is given by an optimization over four parameters only, instead of a computationally heavy optimization over probability distributions.",

author = "Ran Averbuch and Neri Merhav",

note = "Publisher Copyright: {\textcopyright} 2019 IEEE.; 2019 IEEE Information Theory Workshop, ITW 2019 ; Conference date: 25-08-2019 Through 28-08-2019",

year = "2019",

month = aug,

doi = "10.1109/ITW44776.2019.8989340",

language = "الإنجليزيّة",

series = "2019 IEEE Information Theory Workshop, ITW 2019",

booktitle = "2019 IEEE Information Theory Workshop, ITW 2019",

}

TY - GEN

T1 - Error Exponents of Typical Random Codes of Source-Channel Coding

AU - Averbuch, Ran

AU - Merhav, Neri

PY - 2019/8

Y1 - 2019/8

N2 - The error exponent of the typical random code (TRC) in a communication scenario of source-channel coding with side information at the decoder is the main objective of this work. We derive a lower bound, which is at least as large as the random binning-coding exponent due to Merhav (2016), and we show numerically that it may be strictly larger. We deduce the exponents of the TRCs in two special cases: Slepian-Wolf (SW) source coding and joint source-channel coding. Each of these models is further studied in order to provide deeper intuition concerning the behavior of the typical random code. We also propose an alternative expression for the error exponent of typical random binning in SW model, which is given by an optimization over four parameters only, instead of a computationally heavy optimization over probability distributions.

AB - The error exponent of the typical random code (TRC) in a communication scenario of source-channel coding with side information at the decoder is the main objective of this work. We derive a lower bound, which is at least as large as the random binning-coding exponent due to Merhav (2016), and we show numerically that it may be strictly larger. We deduce the exponents of the TRCs in two special cases: Slepian-Wolf (SW) source coding and joint source-channel coding. Each of these models is further studied in order to provide deeper intuition concerning the behavior of the typical random code. We also propose an alternative expression for the error exponent of typical random binning in SW model, which is given by an optimization over four parameters only, instead of a computationally heavy optimization over probability distributions.

UR - http://www.scopus.com/inward/record.url?scp=85081098555&partnerID=8YFLogxK

U2 - 10.1109/ITW44776.2019.8989340

DO - 10.1109/ITW44776.2019.8989340

M3 - منشور من مؤتمر

T3 - 2019 IEEE Information Theory Workshop, ITW 2019

BT - 2019 IEEE Information Theory Workshop, ITW 2019

T2 - 2019 IEEE Information Theory Workshop, ITW 2019

Y2 - 25 August 2019 through 28 August 2019

ER -

Error Exponents of Typical Random Codes of Source-Channel Coding

Abstract

Publication series

Conference

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this