TY - GEN
T1 - Achievable and converse bounds over a general channel and general decoding metric
AU - Elkayam, Nir
AU - Feder, Meir
N1 - Publisher Copyright:
© 2015 IEEE.
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.
T2 - 2015 IEEE Information Theory Workshop, ITW 2015
Y2 - 26 April 2015 through 1 May 2015
ER -