ハミング距離
1. Hamming distanceIn information theory, the Hamming distance between two strings of equal length is the number of positions at which the corresponding symbols are different. Put another way, it measures the minimum number of substitutions required to change one string into the other, or the number of errors that transformed one string into the other.
Read “Hamming distance” on English Wikipedia
Read “ハミング距離” on Japanese Wikipedia
Read “Hamming distance” on DBpedia
Read “Hamming distance” on English Wikipedia
Read “ハミング距離” on Japanese Wikipedia
Read “Hamming distance” on DBpedia
Discussions
Log in to talk about this word.