linear adj. 1.線的,直線的。 2.長度的。 3.【數(shù)學】一次的,線性的。 4.【動、植】線狀的;細長的。 5.由線條組成的,以線條為主的,強調線條的。 linear amplification 直線放大。 a linear equation 一次方程式。 a linear leaf 線形葉。 linear arts 線條藝術。
code n. 1.法典;法規(guī)。 2.規(guī)則,準則;(社會、階級等的)慣例,習俗,制度。 3.(電)碼,代碼,密碼,暗碼;代號,略號,暗號。 4.【生物學】遺傳(密)碼。 the civil [criminal] code民[刑]法典。 the moral code道德準則。 code of signals 信號密碼(本)。 code of the school 校規(guī)。 code and conventions 規(guī)章制度。 C- Napoléon 拿破侖法典。 C- of Hammurabi (古代巴比倫的)漢穆拉比法典。 code of honour 社會禮法;決斗慣例。 code of written law 成文法典。 the International Code 國際電碼。 the Morse code 摩爾斯電碼。 vt. 1.把…編成法典[法規(guī)]。 2.把…譯成[編成]電碼;編(碼);譯(碼)。 n. -r 【自動化】編碼裝置;【電訊】記發(fā)器。
Automorphism group of a linear code is obtained with the help of the general linear group constructed by all invertible matrices , and it is illustrated by matrices generalized inverses 給出了通過求解可逆矩陣構成的一般線性群,獲得線性碼的自同構群的方法,并利用矩陣廣義逆理論,對線性碼的自同構群進行進一步刻劃。
First , considering the construction characteristic of reed - solomon code , we present a kind of new construction method for linear codes by using the factorization properties of cyclotomic polynomials on finite fields 在糾錯碼的設計與分析方面:首先,結合reed - solomon碼的構造特點,利用有限域f _ q上分圓多項式的分解特性來構造f _ q上線性碼。
In 1994 , p . ryndiah investigates turbo product code . it is a kind of block code , of which sub - code is linear code . its decoding method adopts siso iterative , the same as turbo code , so called turbo product code 1994年p . ryndiah提出了turbo乘積碼,它是一種分組碼,其子碼采用線性碼,由于譯碼方法采用與turbo碼相同的軟入軟出( siso )迭代譯碼算法,所以稱為turbo乘積碼。
Finally , the optimum encoding of an unequal error protection linear code is discussed . turbo codes and their unequal error protection are studied in the fifth chapter . after performance analyzing of turbo codes , the map decoding algorithm and its simulation results are given 第五章是針對turbo碼展開的,先給出了turbo碼的性能分析,然后討論了turbo碼的map ( maximumapostiori )解碼算法,并仿真了map算法的性能。
Some results on the undetected error probability of linear codes for pure error - detection are , at present , generalized for both error detection and correction . an analytic formula is obtained to calculate the undetected error probability of linear block codes for simultaneous error detection and correction 在只檢錯時,證明了糾正兩個錯誤擴展bch碼是最佳檢錯碼; m大于4的非線性等重碼( 2m , 2 , m )不是最佳碼。
- the trace representation and the 2 - adic representation for the dual of the quaternary goethals code are given , and its binary image is proved to be the formal dual of the binary goethals code . - the generalized macwilliams identities are given for the support weight distribution of a quaternary linear code with type 4k and that of its dual code 給出了四元goethals碼的對偶碼的跡表示及2 - adic表示,并證明了它在gray映射下的二元像是二元goethals碼的形式對偶碼;從而可以將對非線性碼二元goethals碼及其形式對偶碼的研究轉化為對四元線性碼的研究; 3
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重量的現(xiàn)狀和意義;第二章給出了全文的預備知識;第三章研究了線性碼的廣義hamming重量的一些上下界;包括d ( r , n , k )界,上下限函數(shù)有限和表達式,廣義griesmer界;第四章討論了非線性碼及非線性等重碼的廣義hamming重量的定義、性質,給出了2元( n , m , d )非線性碼的第r廣義hamming重量的表達式;第五章研究了線性碼、非線性碼的重量譜系;第六章給出了幾類碼的廣義hamming重量的表達式,這些碼包括直和碼( directsumcodes ) 、笛卡爾積碼( cartesianproductcodes ) 、張量積碼( tensorproductcodes ) 、延長hamming碼。
This thesis sets out from the two generation methods of non - linear long periodic sequence , analyzes the correlation of the pieces of long periodic non - linear compound codes by confidence interval estimation and massey algorithm . based on the analysis results , this thesis summarizes two basic rules - the linear complexity of the compound codes and the correlation of the pieces of long period codes are both improved with the increase of the length of partial m sequence . and then , the general methods of the generation of long periodic non - linear codes with special characters are presented 本文由兩種非線性長序列的構造方法出發(fā),利用區(qū)間估計的方法和梅西算法,分析長周期非線性序列的局部互相關特性和線性復雜度,再以多個序列的性能分析結果為指導,總結出序列的局部互相關特性隨子序列m序列的截段長度的增加而改善和序列的線性復雜度隨子序列m序列的截段長度的增加而增加這兩條基本規(guī)律,進而提出構造滿足人們不同要求的非線性長周期序列的一般思路。
By computer sampling the long periodic sequence and estimate the confidence interval , we can conclude the cross correlation value of long periodic sequence is biger than 0 . 03 with a probability lower than 10 - 7 . this thesis also presents a new quick acquisition method of long periodic non - linear codes used in the satellite navigation and positioning signal ( snps ) 通過計算機采樣數(shù)據(jù)和區(qū)間估計,對于超長偽隨機序列可以以99 . 99的概率確信,在2048相關長度的條件下,長碼的局部互相關值超過0 . 03的概率低于10 ~ ( - 7 )數(shù)量級。
The new linear code have the following characteristics : ( l ) the new code is the generalization of reed - solomon code and the linear code constructed by chaoping xing and san ling in 2000 ; ( 2 ) compared with brouwer ' table of the best known codes , we find more new codes , there are at least 100 new codes under two - dimension cases 這類碼的特點是: ( 1 )新碼是reed - solomon碼和新加坡國立大學chaopingxing和sanlin在2000年所構造的線性碼的推廣; ( 2 )這類碼中有許多種碼的參數(shù)優(yōu)于brouwer碼表,僅二維情形時,就有100多種碼優(yōu)于brouwer碼表。
In coding theory, a linear code is an error-correcting code for which any linear combination of codewords is also a codeword. Linear codes are traditionally partitioned into block codes and convolutional codes, although turbo codes can be seen as a hybrid of these two types.