2013•Unpublished venueRequires access

The meta-converse bound is tight

Gonzalo Vazquez-Vilar, Adrià Tauste Campo, Albert Guillén i Fàbregas, Alfonso García Martínez

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.

About this research paper

What this paper is about

Why it matters

OpenAlex reports 4 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Converse, Upper and lower bounds, Probability of error, Mathematics, Computer science, Code (set theory), Discrete mathematics, Algorithm