By using the average Hamming distance and variance,we study q-ary code C with length n and number of codewords M ,by the definitiond(xi,yi) function, and give lower bound of the average Hamming distance and variance for q-ary code C with length n.
The concept of the degree of similarity between interval-valued intuitionistic fuzzy sets (IVIFSs) is introduced,and some distance measures between IVIFSs are defined based on the Hamming distance,the normalized Hamming distance,the weighted Hamming distance,the Euclidean distance,the normalized Euclidean distance,and the weighted Euclidean distance,etc.
This algorithm utilizes the phase characters of Gabor function to encode iris texture. A pattern matching algorithm based on weight Hamming distance was discussed for this kind of iris codes. The result of experiment shows that this encoding method has a good recognition effect and very high speed of operation.
Analyzing the approximate repetitions and similarity measurements and based on Hamming Distance,two definitions of pattern-similarity and segment-similarity are proposed as new measurements of similarity,then on the basis of the two definitions,a new concept of approximate repetition,i. e. , the segment-similarity based approximate tandem repeats(SATR) is given.
在对重复片段的相似性衡量进行分析之后,基于海明距离提出了新的相似度衡量标准模式相似度和片段相似度,并在此基础上提出了一个新的相似性重复片段的定义SATR(segment-similarity based approximate tandem repeats).
One point of the initial multi-form is replaced with the local minimum gotten by the new ant colony algorithm using the substitution rule based on the minimum hamming distance and the complex method is apt to find the global minimum safety factor.
We derive asymptotically sharp cardinality bounds in the case of the Hamming distance and show that for small subsets a suitably defined "randomized" Hamming distance allows one to get tighter estimates of the cardinality.
If also the first and last words are Hamming distance one apart, the sequence is called a cube dominating cycle.
A sequence of binary words of length n is called a cube dominating path, if the Ham-ming distance between two consecutive words is always one, and every binary word of length n is within Hamming distance one from at least one of these words.
Recently, the Systematic Distance-4 (SD-4) codes are proposed that allows generating all the optimal Hamming distance-4 binary linear block codes.
Since computing the Hamming distance of the inputs in hardware is expensive, only a portion of the inputs are examined.