@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 = "ארצות הברית",
}