Overview

Hamming distance


Show Summary Details

Quick Reference

The minimum distance between any two codewords in a code. If a codeword is received which does not exist in the code, the decoder will assign a codeword of the same length with the smallest Hamming distance.

Subjects: Computing.

Related content in Oxford Index

See all related items in Oxford Index »

Reference entries
Hamming distance
in A Dictionary of Computing

Reference Entry

Hamming distance
in The Concise Oxford Dictionary of Mathematics

Reference Entry

Hamming metric
in A Dictionary of Computing

Reference Entry

Hamming space
in A Dictionary of Computing

Reference Entry

Search for the text `Hamming distance' anywhere in Oxford Index »

Users without a subscription are not able to see the full content. Please, subscribe or login to access all content.