hamming distance 中文意思是什麼
hamming distance
解釋
海明距離-
Dual and cyclic code of equal hamming distance and its antithesis code
二元等漢明距離循環碼及其對偶碼 -
We excogitate the gabor filter based - on sub - block texture analyse to extract the feature of iris normalized image and encode them. then, we use hamming distance to match two iris codes. in order to reduce the rotation of iris, we work out a new method
4 .研究出基於子塊紋理分析的gabor濾波器方法來對虹膜歸一化圖像進行特徵提取和編碼;在虹膜編碼匹配中，本論文採用hamming距離來進行編碼之間的匹配。 -
This paper researches on the fast algorithm of hamilton array codes for high dimension and big hamming distance and key schedule algorithm based on hamilton array codes
本文主要針對快速高維大碼距hamilton陣列編碼的構造演算法及其在分組密碼的密鑰編排演算法中的應用進行了研究。 -
Lastly, we design a key schedule algorithm helped by lfsr and hamilton array codes. the innovation of the thesis is given bellow : first : construct and program the fast algorithm of hamilton array codes for high dimension and big hamming distance
本文的創新之處有： 1 、構造和實現了快速高維大碼距hamilton的陣列編碼構造演算法； 2 、提出了一個基於lfsr和hamilton陣列編碼的通用密鑰編排演算法。 -
Main contributions of this thesis are as follows : firstly, describe the theory of the hamilton array codes and its general construction. secondly, we construct and program the fast algorithm of hamilton array codes for high dimension and big hamming distance. thirdly, we discussion the design principle of the symmetry ciphers
內容包括：首先論述了hamilton陣列編碼的理論和常規構造方法；然後，構造和實現了快速高維大碼距hamilton的陣列編碼構造演算法；接著，探討了對稱密碼（包括分組密碼和序列密碼）的設計原理，最後，結合lfsr和hamilton陣列產生通用密鑰編排演算法。 -
Such recognition algorithms the feature extraction based on a set of 2 - d gabor wavelet and computation of percentage mismatched bits hamming distance between a pair of iris representations developed by daugman, texture analysis methods developed by wildes and chinese academy of science, extraction of iris signatures by means of zero - crossing of the dyadic wavelet transform developed by boles and so on
深入研究了多種典型識別演算法: daugman的基於2 - d復值gabor小波的虹膜相位編碼和hamming距離的方法; wildes和中科院的基於虹膜紋理分析的方法; boles的基於小波過零檢測的方法;上海交大的基於小波模極大值的方法等。並在此基礎上，對虹膜識別系統中的圖像預處理和識別的若干演算法進行了改進。 -
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的推廣能力與編碼長度、碼間漢明距離、編碼順序以及分類間隙等之間的關系，給出了這種關系的數學描述。 -
It is considered as the most exciting and potentially important development in coding theory in recent years. its invention has changed the conventional design principles of the coding scheme from the attempt to increase the minimum hamming distance of the code to the goal of reducing the number of code words with low hamming weights
Turbo碼具有近shannon限的性能，它的出現被看作是通道編碼理論發展史上的一個里程碑，它使人們設計通道編碼的方法從增加碼的最小漢明距離轉向了減少低重量碼字的個數（錯誤系數） 。 -
As a relatively new branch in the inverse optimization area, inverse network optimization problems under hamming distance have been shown to be theoretically interesting and practically useful
作為逆優化問題中相對較新的一個分支，哈明距離下的網路逆問題具有較大的理論研究及實際應用價值。 -
The paper studies optimization design in structure reinforcement by means of relative membership degree theory in fuzzy mathematics. the fuzzy optimization model is based on the parameter which is indicted by the hamming distance as p = 1
本文採用模糊數學中的相對隸屬度理論對建築結構加固方案進行優化設計，採用的優化模型為參數p = 1時的海明權距離表示的模糊優化模型。 -
In this thesis, we review the joint source and channel coding firstly, introducing fundamental theories, design methodologies, and practical applications. secondly, an approach is presented for improving arithmetic coding by embedding hamming distance. the approach prevents error propagation of the arithmetic coding
作者在對算術編碼做了深入研究的基礎上，運用漢明距離對其加以改進，使算術編碼具有了較好的糾錯能力，克服了算術編碼易受傳輸錯誤的影響，使其適用於通道干擾較大的場合。 -
In this paper, a general dynamical fuzzy neural network model ? fuzzy hopfield networks with threshold is developed, which is based on the fuzzy operator composition of max ( ) and weakly continuous t - norms. it is shown that the model is global stable with the hamming distance, and its equilibrium point ( attractor ) is lyapunov stable. finally, a simulation example is employed to demonstrate our conclusions
模與取大（ ）模糊運算元的復合，建立了具有一般意義的動態模糊神經網路? ?帶閾值的模糊hopfield神經網路，並系統分析了該動態系統的性能:在hamming距離意義下證明了該網路是穩定的，而且其平衡點（吸引子）具有全局lyapunov穩定性。
分享友人