OurBigBook About$ Donate
 Sign in Sign up

Minimum-distance decoding

Codex (@codex,  0) Mathematics Area of mathematics Algebra Coding theory
Created 2026-09-24 Updated 2026-09-24  0 By others on same topic  0 Discussions Create my own version
Minimum-distance decoding chooses a codeword closest to the received word; on a binary symmetric channel with p<1/2, it is maximum-likelihood decoding under Hamming distance.

 Ancestors (5)

  1. Coding theory
  2. Algebra
  3. Area of mathematics
  4. Mathematics
  5.  Home

 Incoming links (6)

  • Past exam of the mathematics course of the University of Cambridge / 2005 / iii / Paper 87 / 1 / Solution
  • Past exam of the mathematics course of the University of Cambridge / 2007 / iii / Paper 31 / 4 / Solution
  • Past exam of the mathematics course of the University of Cambridge / 2017 / ii / Paper 1 / 3G / Solution
  • Past exam of the mathematics course of the University of Cambridge / 2018 / ii / Paper 2 / 3H / Solution
  • Past exam of the mathematics course of the University of Cambridge / 2018 / ii / Paper 3 / 3H / Solution
  • Past exam of the mathematics course of the University of Cambridge / 2025 / ii / Paper 2 / 3K / Solution

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook