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

Nir Elkayam, Meir Feder

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-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 languageEnglish
Title of host publication2015 IEEE Information Theory Workshop, ITW 2015
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781479955268
DOIs
StatePublished - 24 Jun 2015
Event2015 IEEE Information Theory Workshop, ITW 2015 - Jerusalem, Israel
Duration: 26 Apr 20151 May 2015

Publication series

Name2015 IEEE Information Theory Workshop, ITW 2015

Conference

Conference2015 IEEE Information Theory Workshop, ITW 2015
Country/TerritoryIsrael
CityJerusalem
Period26/04/151/05/15

Fingerprint

Dive into the research topics of 'Achievable and converse bounds over a general channel and general decoding metric'. Together they form a unique fingerprint.

Cite this