A Sphere-Packing Error Exponent for Mismatched Decoding

11/08/2021
by   Ehsan Asadi Kangarshahi, et al.
0

We derive a sphere-packing error exponent for coded transmission over discrete memoryless channels with a fixed decoding metric. By studying the error probability of the code over an auxiliary channel, we find a lower bound to the probability of error of mismatched decoding. The bound is shown to decay exponentially for coding rates smaller than a new upper bound to the mismatch capacity. For rates higher than the new upper bound, the error probability is shown to be bounded away from zero. The new upper bound is shown to improve over previous upper bounds to the mismatch capacity.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/18/2022

Achievable error exponents of data compression with quantum side information and communication over symmetric classical-quantum channels

A fundamental quantity of interest in Shannon theory, classical or quant...
research
07/28/2020

A Single-Letter Upper Bound on the Mismatch Capacity via Multicast Transmission

We derive a single-letter upper bound on the mismatch capacity of a stat...
research
04/03/2020

A Single-Letter Upper Bound to the Mismatch Capacity

We derive a single-letter upper bound to the mismatched-decoding capacit...
research
07/25/2023

The Method of Types for the AWGN Channel

For the discrete-time AWGN channel with a power constraint, we give an a...
research
09/02/2022

An Upper Bound on the Reliability Function of the DMC

We derive a new upper bound on the reliability function for channel codi...
research
05/27/2018

Converse Theorems for the DMC with Mismatched Decoding

The problem of mismatched decoding with an additive metric q for a discr...
research
05/09/2018

Dispersion Bound for the Wyner-Ahlswede-Körner Network via Reverse Hypercontractivity on Types

Using the functional-entropic duality and the reverse hypercontractivity...

Please sign up or login with your details

Forgot password? Click here to reset