环Z/(2~e-1)上本原序列还原算法研究  

Research on the Recovering Algorithm of Primitive Sequences over Z/(2~e-1)

作　　者：毛竞[1] 朱宣勇[1] 戚文峰[1] 

机构地区：[1]信息工程大学数学工程与先进计算国家重点实验室,河南郑州450001

出　　处：《信息工程大学学报》2013年第2期129-134,共6页Journal of Information Engineering University

基　　金：国家自然科学基金资助项目(61170235;61100200;61100202)

摘　　要：通过建立非线性方程组的方法,给出一个还原算法,它只需要信息量长度的比特序列就可以还原整体序列;通过分析非线性方程组构建的计算量和方程项数的膨胀情况,给出了还原难度的定性评估;另外还给出一个基于最小次数项的二元域上非线性方程组的求解算法。A recovering algorithm is presented in this paper by establishing a set of nonlinear equations, which can recover the original sequence by using a number of bits of its known level sequence, where the bits needed are just more than sequence entropy. Moreover, an algorithm is presented based on terms with the lowest degree to solve nonlinear equations over the binary field GF （2）.

关 键 词：线性递归序列 本原序列 还原算法 非线性方程组 

分 类 号：TN918.1[电子电信—通信与信息系统]