Matched Metrics and Channels

DOI10.1109/TIT.2015.2512596MaRDI QIDQ2976950zbMATH OpenFDO

Authors Marcelo Firer, Judy L. Walker

Publication date 28 April 2017

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

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

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Channel models (including quantum) in information and communication theory (94A40) Decoding (94B35)

Abstract: The most common decision criteria for decoding are maximum likelihood decoding and nearest neighbor decoding. It is well-known that maximum likelihood decoding coincides with nearest neighbor decoding with respect to the Hamming metric on the binary symmetric channel. In this work we study channels and metrics for which those two criteria do and do not coincide for general codes.

Cited in

(3)

• A distance between channels: the average error of mismatched channels
• Channel metrization
• Minimum dimensional Hamming embeddings

This page was built for publication: Matched Metrics and Channels

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