Achievable and converse bounds over a general channel and general decoding metric

Nir Elkayam; Meir Feder

doi:10.1109/ITW.2015.7133137

Achievable and converse bounds over a general channel and general decoding metric

Nir Elkayam, Meir Feder

School of Electrical Engineering

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

Abstract

Achievable and converse bounds for general channels and mismatched decoding are derived. The direct (achievable) bound is derived using random coding and the analysis is tight up to factor 2. The converse is given in term of the achievable bound and the factor between them is given. This gives performance of the best rate-R code with possible mismatched decoding metric over a general channel, up to the factor that is identified. In the matched case we show that the converse equals the minimax meta-converse of Polyanskiy et al. [1].

Original language	English
Title of host publication	2015 IEEE Information Theory Workshop, ITW 2015
Publisher	Institute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)	9781479955268
DOIs	https://doi.org/10.1109/ITW.2015.7133137
State	Published - 24 Jun 2015
Event	2015 IEEE Information Theory Workshop, ITW 2015 - Jerusalem, Israel Duration: 26 Apr 2015 → 1 May 2015

Publication series

Name	2015 IEEE Information Theory Workshop, ITW 2015

Conference

Conference	2015 IEEE Information Theory Workshop, ITW 2015
Country/Territory	Israel
City	Jerusalem
Period	26/04/15 → 1/05/15

Access to Document

10.1109/ITW.2015.7133137

Cite this

@inproceedings{c8e17a744f5043f8920e049e9f1b4a59,

title = "Achievable and converse bounds over a general channel and general decoding metric",

abstract = "Achievable and converse bounds for general channels and mismatched decoding are derived. The direct (achievable) bound is derived using random coding and the analysis is tight up to factor 2. The converse is given in term of the achievable bound and the factor between them is given. This gives performance of the best rate-R code with possible mismatched decoding metric over a general channel, up to the factor that is identified. In the matched case we show that the converse equals the minimax meta-converse of Polyanskiy et al. [1].",

author = "Nir Elkayam and Meir Feder",

note = "Publisher Copyright: {\textcopyright} 2015 IEEE.; null ; Conference date: 26-04-2015 Through 01-05-2015",

year = "2015",

month = jun,

day = "24",

doi = "10.1109/ITW.2015.7133137",

language = "אנגלית",

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

publisher = "Institute of Electrical and Electronics Engineers Inc.",

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

address = "ארצות הברית",

}

Elkayam, N & Feder, M 2015, Achievable and converse bounds over a general channel and general decoding metric. in 2015 IEEE Information Theory Workshop, ITW 2015., 7133137, 2015 IEEE Information Theory Workshop, ITW 2015, Institute of Electrical and Electronics Engineers Inc., 2015 IEEE Information Theory Workshop, ITW 2015, Jerusalem, Israel, 26/04/15. https://doi.org/10.1109/ITW.2015.7133137

Achievable and converse bounds over a general channel and general decoding metric. / Elkayam, Nir; Feder, Meir.

2015 IEEE Information Theory Workshop, ITW 2015. Institute of Electrical and Electronics Engineers Inc., 2015. 7133137 (2015 IEEE Information Theory Workshop, ITW 2015).

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

TY - GEN

T1 - Achievable and converse bounds over a general channel and general decoding metric

AU - Elkayam, Nir

AU - Feder, Meir

PY - 2015/6/24

Y1 - 2015/6/24

N2 - Achievable and converse bounds for general channels and mismatched decoding are derived. The direct (achievable) bound is derived using random coding and the analysis is tight up to factor 2. The converse is given in term of the achievable bound and the factor between them is given. This gives performance of the best rate-R code with possible mismatched decoding metric over a general channel, up to the factor that is identified. In the matched case we show that the converse equals the minimax meta-converse of Polyanskiy et al. [1].

AB - Achievable and converse bounds for general channels and mismatched decoding are derived. The direct (achievable) bound is derived using random coding and the analysis is tight up to factor 2. The converse is given in term of the achievable bound and the factor between them is given. This gives performance of the best rate-R code with possible mismatched decoding metric over a general channel, up to the factor that is identified. In the matched case we show that the converse equals the minimax meta-converse of Polyanskiy et al. [1].

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

U2 - 10.1109/ITW.2015.7133137

DO - 10.1109/ITW.2015.7133137

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84938937822

T3 - 2015 IEEE Information Theory Workshop, ITW 2015

BT - 2015 IEEE Information Theory Workshop, ITW 2015

PB - Institute of Electrical and Electronics Engineers Inc.

Y2 - 26 April 2015 through 1 May 2015

ER -

Achievable and converse bounds over a general channel and general decoding metric

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this