2015/06/11 by Marcelo Firer, Firer, Marcelo, Judy L. Walker +1 · 1 citation
Computer Science · Engineering · #68P30 #Advanced Wireless Communication Techniques #Coding theory and cryptography #Combinatorics (math.CO) #FOS: Computer and information sciences #FOS: Mathematics #Information Theory (cs.IT) #graph theory and CDMA systems
paper · pdf · doi:10.48550/arxiv.1506.03782
openalex publication_date 2015/06/11 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.