Matched Metrics to the Binary Asymmetric Channels

DOI10.1109/TIT.2018.2885782zbMATH Open1428.62035arXiv1606.09494OpenAlexW2963030652WikidataQ128760193 ScholiaQ128760193MaRDI QIDQ4615371FDOQ4615371

Authors: Claudio Qureshi 

Publication date: 28 January 2019

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1606.09494

Mathematics Subject Classification ID

Statistical aspects of information-theoretic topics (62B10) Applications of graph theory (05C90) Decoding (94B35)

Cited In (3)

• A distance between channels: the average error of mismatched channels
• Channel metrization
• Comparison of Channels: Criteria for Domination by a Symmetric Channel

This page was built for publication: Matched Metrics to the Binary Asymmetric Channels

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4615371)