Title
The meta-converse bound is tight
Abstract
We show that the meta-converse bound derived by Polyanskiy et al. provides the exact error probability for a fixed joint source-channel code and an appropriate choice of the bound parameters. While the expression is not computable in general, it identifies the weaknesses of known converse bounds to the minimum achievable error probability.
Year
DOI
Venue
2013
10.1109/ISIT.2013.6620523
Information Theory Proceedings
Keywords
Field
DocType
combined source-channel coding,error statistics,error probability,fixed joint source-channel code,meta-converse bound
Discrete mathematics,Converse,Binary symmetric channel,Coding gain,Combinatorics,Error exponent,Probability of error,Fixed joint,Mathematics,Variable-length code
Conference
ISSN
Citations 
PageRank 
2157-8095
1
0.38
References 
Authors
5
6