查找代码的汉明距离 [英] Finding hamming distance of code

问题描述

一个问题询问:找到以下代码的汉明距离:

A question asks: find the hamming distance of the following code:

11111  
10101  
01010  
11100  
00011  
11001

答案是2.这是如何工作的?我以为汉明距离只是在两根弦之间?

The answer is 2. How does this work? I thought hamming distance is only between two strings?

推荐答案

代码的汉明距离定义为任意两个代码字之间的最小距离.因此，在您的情况下，找到列出的两个码字之间的汉明距离，没有一个不小于2.

The Hamming distance of a code is defined as the minimum distance between any 2 codewords. So, in your case, finding the Hamming distance between any 2 of the listed codewords, no one is less than 2.

这篇关于查找代码的汉明距离的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！