linear code造句
例句与造句
- - 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重量的现状和意义；第二章给出了全文的预备知识；第三章研究了线性码的广义hamming重量的一些上下界；包括d ( r , n , k )界，上下限函数有限和表达式，广义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
本文由两种非线性长序列的构造方法出发，利用区间估计的方法和梅西算法，分析长周期非线性序列的局部互相关特性和线性复杂度，再以多个序列的性能分析结果为指导，总结出序列的局部互相关特性随子序列m序列的截段长度的增加而改善和序列的线性复杂度随子序列m序列的截段长度的增加而增加这两条基本规律，进而提出构造满足人们不同要求的非线性长周期序列的一般思路。 - 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 )
通过计算机采样数据和区间估计，对于超长伪随机序列可以以99 . 99的概率确信，在2048相关长度的条件下，长码的局部互相关值超过0 . 03的概率低于10 ~ ( - 7 )数量级。 - 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 )这类码中有许多种码的参数优于brouwer码表，仅二维情形时，就有100多种码优于brouwer码表。 - It's difficult to find linear code in a sentence. 用linear code造句挺难的
- The background and research situation of ldpc codes are presented and the current research results are introduced in the first part of the thesis . graph presentation and sum - product algorithm are interpreted in detail . linear coding theory and efficient constructing methods on ldpc codes are systemically interpreted later
系统地阐述了ldpc码的图模型表示方法及基于图模型的译码原理；详细地介绍了ldpc码的构造方法及其线性编码理论；介绍了用于ldpc码阈值分析和度序列设计的密度进化理论； 2 - In this paper , we study the stopping sets , stopping distance and stopping redundancy for binary linear codes . stopping redundancy is a new concept proposed by schwartz and vardy recently for evaluating the performance of a linear code under iterative decoding over a binary erasure channel . since the exact value of stopping redundancy is difficult to obtain in general , good lower and upper bounds are important
近年来，迭代译码的性能分析是低密度校验ldpc码研究领域的热点问题之一， di等人在2001年指出：迭代译码在二元删除信道bec中的性能可以由ldpc码的停止集stopping set完全刻画。
更多例句： 上一页