Matched Metrics and Channels

Authors

Marcelo Firer, University of CampinasFollow
Judy L. Walker, University of Nebraska - LincolnFollow

Document Type

Article

Date of this Version

3-2016

Citation

http://arxiv.org/abs/1506.03782v1

Published in IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 62, NO. 3, MARCH 2016

doi 10.1109/TIT.2015.2512596

Comments

Copyright 2015 IEEE. Used by permission.

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.