pith. sign in

arxiv: 1506.03782 · v1 · pith:CRDYY26Dnew · submitted 2015-06-11 · 💻 cs.IT · math.CO· math.IT

Matched Metrics and Channels

classification 💻 cs.IT math.COmath.IT
keywords decodingchannelscriterialikelihoodmaximummetricsnearestneighbor
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.