汉明距离 meaning in Chinese
hamming distance
Examples
- Computation of the minimum distance of low - density parity - check codes
码的最小汉明距离估算 - Dual and cyclic code of equal hamming distance and its antithesis code
二元等汉明距离循环码及其对偶码 - Every class endues a binary code , then a set of svms are used to solve the multiple binary problems . the generalization performance of ecc - svm is analyzed , which is determined by code length , hamming distance , coding sequence and margins of svms
本文提出了基于纠错编码的svm多类分类算法( ecc - svm ) ，并分析了ecc - svm的推广能力与编码长度、码间汉明距离、编码顺序以及分类间隙等之间的关系，给出了这种关系的数学描述。 - ( 4 ) to classify the feature vevtors extracted by gaussian - hermite moment , the drawbacks of the previous way is analysed first , then two new approaches are introduced . one is based on the way of 0 - 1 coding and hanming matching , the other is performed with knr classifier
4 .针对用gaussian - hermite矩提取的特征向量,先介绍已有的分类方法,指出其不足,然后给出了一种简单的先对特征向量0 - 1编码,再用汉明距离匹配的方法。 - Turbo code is regarded as the milestone in channel encoding theory history for its performance closing to shannon limit , which makes us covert to decrease the numbers of light weight code ( error coefficient ) from increasing the minimum hanming weigh . the research and analysis are concentrated on the following : 1
Turbo码具有近shannon限的性能，它的出现被看作是信道编码理论发展史上的一个里程碑，它使人们设计信道编码的方法从增加码的最小汉明距离转向了减少低重量码字的个数(错误系数) 。