Achievable and Converse bounds over a general channel and general decoding metric
Information Theory
2015-01-20 v3 math.IT
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.
Cite
@article{arxiv.1411.0319,
title = {Achievable and Converse bounds over a general channel and general decoding metric},
author = {Nir Elkayam and Meir Feder},
journal= {arXiv preprint arXiv:1411.0319},
year = {2015}
}
Comments
Accepted to ITW 2015, Added "sphere packing" proof of the meta-converse, Correct the mismatched converse to incoporate tie breaking