A Distance Between Channels: the average error of mismatched channels

02/06/2018
by   Rafael G. L. D'Oliveira, et al.
0

Two channels are equivalent if their maximum likelihood (ML) decoders coincide for every code. We show that this equivalence relation partitions the space of channels into a generalized hyperplane arrangement. With this, we define a coding distance between channels in terms of their ML-decoders which is meaningful from the decoding point of view, in the sense that the closer two channels are, the larger is the probability of them sharing the same ML-decoder. We give explicit formulas for these probabilities.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/07/2022

On The Decoding Error Weight of One or Two Deletion Channels

This paper tackles two problems that are relevant to coding for insertio...
research
01/15/2020

The Error Probability of Maximum-Likelihood Decoding over Two Deletion Channels

This paper studies the problem of reconstructing a word given several of...
research
02/20/2018

Capacity-achieving decoding by guessing noise

We introduce a new algorithm for realizing Maximum Likelihood (ML) decod...
research
07/23/2020

The MMI Decoder is Asymptotically Optimal for the Typical Random Code and for the Expurgated Code

We provide two results concerning the optimality of the maximum mutual i...
research
08/23/2021

Decoding Error Probability of the Random Matrix Ensemble over the Erasure Channel

Using tools developed in a recent work by Shen and the second author, in...
research
11/08/2019

Maximum Likelihood Decoding of Convolutionally Coded Noncoherent ASK Signals in AWGN Channels

In this work we develop the maximum likelihood detection (MLD) algorithm...
research
10/18/2022

Efficient Machine-Learning-based decoder for Heavy Hexagonal QECC

Errors in heavy hexagonal code and other topological codes like surface ...

Please sign up or login with your details

Forgot password? Click here to reset