【摘要】 <正> 设 f(x₀,x₁,…,x_n-1)=x₀+f₀(x₁,…,x_n-1)是一 n 元非奇布尔函数,其中加法是模2加.假定二元域 F₂上的无穷序列 α=（a₀,a₁,a₂,…）,a_i∈F₂,i≥0,满足a_k+n=f(a_k,a_k+1,…,a_k+n-1,（?）k≥0,则称α是以 f 为反馈函数的 n 级移位寄存器序列,并以（?）（f）记所有以 f 为反馈函数的亭列组成的集合.因为 f 非奇,所以（?）（f）中的序列都是周期序列.对于 α∈（?）（f）,α更多还原

【Abstract】 In this paper,a general method of generating spanning trees in the factor incidentgraph of shift register is proposed.Sevcral classes of feedback functions of M sequen-ces are constructed directly and feedback functions of M sequences are derived fromthese functions.In addition,among the incident graphs,a class of homomorphism isdefined,which can be used to construct M sequences.更多还原