Hamming distance

汉明距离:在信息论中
常用释义
汉明距离:在信息论中,两个等长字符串之间的汉明距离是两个字符串对应位置的不同字符的个数。

例句

1·How to count the hamming distance of two short int?

如何计算汉明距离的两个短整型?

2·Hamming distance is defined as the distance between images.

图像之间的距离被定义为汉明距离。

3·This text introduced the design by FPGA to the Hamming distance by calculating circuit method.

介绍了一种利用FPGA设计汉明距离的电路方法。

4·We import a new method to compute the similarity of text, that is, the algorithm based on Hamming distance.

在计算题干的相似度的时候,采用了一种新的方法——基于汉明距离的相似度计算方法。

5·The Hamming distance between two integers is the number of positions at which the corresponding bits are different.

两个整数的汉明距离是指其二进制不相等的位的个数。

6·The power leakage principle of CMOS device is introduced, which is in direct portion to Hamming distance processed in gate.

文章首先简单分析了CMOS器件工作时产生功耗泄漏的机理,即与门电路内处理数据的汉明距离成正比;

7·Finally, we present an efficient hamming distance ordering algorithm, which is proved to improve the compress gain especially.

文章还给出了一个有效的最小海明距离排序算法,大大的提高了测试数据的压缩率。

8·The Hamming distance between two words a and b, viewed as elements of a vector space, can then be seen as the Hamming weight of ab.

如果把a和b两个单词看作是向量空间中的元素,则它们之间的汉明距离等于它们汉明重量的差a - b。

9·A simple and quick algorithm, integrated with weighted distribution and Hamming distance, is derived from the principle of fuzzy similarity-ratio.

从模糊相似比原理出发,推证出一种简捷的快速算法,并综合了权重和海明距离两方面因素,从而使模糊相似比方法得到改进。

10·The Hamming distance is also equivalent to the Manhattan distance between two vertices in ann-dimensional hypercube, where nis the length of the words.

汉明距离也等于一个n维的超立方体上两个顶点间的曼哈顿距离,n指的是单词的长度。