Minimum-distance decoding with Hamming distance chooses a codeword minimizing the number of positions in which it differs from the received word. Ties may be resolved by a fixed rule.

Ancestors (12)

  1. a
  2. 4
  3. 2007
  4. Past exam of the communication Theory course of the University of Oxford
  5. Communication Theory course of the University of Oxford
  6. Year 3 of the mathematics course of the University of Oxford
  7. Mathematics course of the University of Oxford
  8. Undergraduate course of the University of Oxford
  9. Course of the University of Oxford
  10. University of Oxford
  11. List of universities
  12. Home

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