hamming 中文意思是什麼

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距離來進行編碼之間的匹配。

Do stop hamming !

不要再做戲了吧。

Through summarizing the experiences of the salesman and experts, and drawing lessons from the professional organizations such as banks which have established indexes system for credit rating, the thesis builds its own indexes system of credit rating for tally trade which is intentionally built up for enterprises ; then by contrasting the advantages and disadvantages of the commonly used multi - indexes evaluation methods, adopts the fuzzy hamming network as the primary tool for credit rating

首先通過總結銷售人員經驗，並借鑒銀行等專業機構資信評級所採用的評價指標，建立適合工商企業應用的客戶信用評級指標體系；然後對比常用多指標綜合評價方法的優缺點和適用范圍，確定採用神經網路模型中的模糊hamming網路作為客戶信用評級的主要工具。

The effect of adding windows that included rectangle window hanning window, hamming window, blackman window was also researched

研究了幾種窗函數（矩形窗、漢寧窗、海明窗、布來克蔓窗等）對頻譜分析的影響。

A kind of two - step neural network based on the improved fuzzy hamming net is proposed. and an intelligent fault detecting system of the robot based on this network is established in this paper. an experiment of the foot ' s lifting - and - dropping system of the robot is done

建立了基於vc的壁面機器人的智能故障診斷系統，並進行了對壁面機器人系統的故障診斷實驗，完成了從數據採集、數據預處理、神經網路訓練到系統的故障診斷等一系列實驗過程。

Because of the spectral line splitting of the burg algorithm, the recursive algorithm of the ar model, we choice the hamming weighted burg algorithm in this paper. the modified burg algorithm can weaken the spectral line splitting effectively. however, the ar model can ’ t gain the phase of the inter - harmonics

由於ar模型的遞推演算法burg演算法存在譜線分裂現象，文中選擇使用hamming窗加權的burg演算法來遞推ar模型，修正後的burg演算法明顯減輕了譜線分裂現象，具有較好的抗噪聲能力，但無法得到間諧波的相位信息。

Some results of generalized hamming weights for q - ary non - linear codes

用重要性抽樣方法估計分組碼同時糾錯和檢錯時的性能

The optimum normal water level is decided by the hamming approach degrees of each plan

以待選方案與最優方案間的海明貼近度來決策水庫正常高水位。

This method obtains structure types and strokes of chinese characters through chinese characters mathematic expression, and then the whole document is divided into two blocks by utilizing structure types of chinese characters. in each block, the position selected to embed is chose by chinese character ’ s strokes and the watermarking bit. watermarking bits with a robust structure is generated by chaos encrypting and hamming checkout coding ; embedding is implemented through setting underline to font

該方法通過漢字數學表達式，獲取漢字的結構類型和筆畫數，利用漢字的結構類型將整個文檔分成兩塊，在各塊中由漢字筆畫數和水印比特位共同確定水印加載的位置，通過混沌加密和海明校驗編碼將水印生成一種具有魯棒性的水印結構，然後通過設置字體下劃線將水印按對稱性的嵌入策略分別嵌入文本的兩塊中。

When the watermarking bit is destroyed, which position can be judged exactly, and then block checkout and hamming checkout are used to recover it. meanwhile, watermarking can be extracted without the original document and original watermarking information, which is significative copyright information, so it is a public watermarking technology

抗攻擊時，能準確判斷水印比特位受破壞的具體位置，並能通過塊校驗和海明校驗將破壞的水印比特位進行適當恢復;同時，提取水印時既不需要原始文本，也不需要原始水印，且提取的水印信息是有意義的版權信息，是一種公開水印。

In this paper, we will more deeply research on the base of the works, the first part, we give the summarize for the condition and the significance. the second part, we give the preparation knowledge to the whole paper ; the third part, we research the lower and upper bound of the generalized hamming weights for the linear codes ; include d ( r, n, k ) bound, the finite sum representation of the lower and upper bound function of generalized hamming weights for linear codes, generalized griesmer bounds ; the 4 - th part, research the definition, the property of the r - th generalized weights for the non - linear codes and non - linear constant codes, and give the expression of the generalized weight of binary ( n, m, d ) non - linear codes ; the 5 - th part, research the weight hierarchy of linear codes and non - linear codes, for example, necessary condition and sufficient condition, the 6 - th part, we research the expression of the r - th generalized hamming weights of reseaval classes codes

本文在已有的基礎之上作了進一步的探討，第一章綜述了廣義hamming重量的現狀和意義；第二章給出了全文的預備知識；第三章研究了線性碼的廣義hamming重量的一些上下界；包括d （ r ， n ， k ）界，上下限函數有限和表達式，廣義griesmer界；第四章討論了非線性碼及非線性等重碼的廣義hamming重量的定義、性質，給出了2元（ n ， m ， d ）非線性碼的第r廣義hamming重量的表達式；第五章研究了線性碼、非線性碼的重量譜系；第六章給出了幾類碼的廣義hamming重量的表達式，這些碼包括直和碼（ directsumcodes ） 、笛卡爾積碼（ cartesianproductcodes ） 、張量積碼（ tensorproductcodes ） 、延長hamming碼。

Second, we discuss the correlation properties and the hamming correlation properties of a number of trace function generation sequences by using systematic ways. we calculate the correlation function of generalized trace function sequences which include no sequences > kasami sequences and kumar - moreno sequences, and we also calculate the hamming correlation function of no sequences ^ kasami sequences and kumar - moreno sequences. at last, we degine the frequency - hopping sequences with optimal hamming correlation properties

其次，用較為統一的工具去研究各種跡函數生成序列的相關特性與hamming相關特性，求出了更廣意義下跡函數生成序列的相關函數，這類序列包括了no序列、 kasami序列與kumar - moreno序列；同時求出了no序列、 kasami序列和kumar - moreno序列的hamming相關函數值，研究發現某些具有良好相關特性的跡函數生成序列未必具有良好的hamming相關特性；最後，構造了具有最佳hamming相關性能的跳頻序列族。

For lfm signal, we demonstrate the method of employing hamming weighting, spectrum correcting and phase modulation distortion

對線性調頻信號的旁瓣抑制介紹了經典海明窗加權處理方法、頻譜修正以及相位預矯正幾種方法。

Generalized hamming weights for nonlinear constant weight codes

重量幾點注記

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陣列產生通用密鑰編排演算法。

Abstract this paper investigated the window effects and the spectrum amplitude errors in hamming windowing spectrum analysis in detail and gave its compensation coefficients

摘要主要以漢明窗為例，定量分析了窗函數引起的信號幅度譜誤差，給出了相對幅度譜補償系數的理論值。

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的基於小波過零檢測的方法;上海交大的基於小波模極大值的方法等。並在此基礎上，對虹膜識別系統中的圖像預處理和識別的若干演算法進行了改進。