Year: 2015
Type: preprint
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.
Source: arXiv (Cornell University)
Authors: Firer, Marcelo, Walker, Judy L.
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
Awards: G2667012561, Graph-Based Codes
OpenAlex ID: W2952905899
