Matched Metrics to the Binary Asymmetric Channels
Information Theory
2018-03-20 v2 math.IT
Abstract
In this paper we establish some criteria to decide when a discrete memoryless channel admits a metric in such a way that the maximum likelihood decoding coincides with the nearest neighbour decoding. In particular we prove a conjecture presented by M. Firer and J. L. Walker establishing that every binary asymmetric channel admits a matched metric.
Keywords
Cite
@article{arxiv.1606.09494,
title = {Matched Metrics to the Binary Asymmetric Channels},
author = {Claudio M. Qureshi},
journal= {arXiv preprint arXiv:1606.09494},
year = {2018}
}