Notes on q-ary interleaved sequences

(f(x),m)-interleaved sequences over Fq have been proposed and studied.Roughly speaking,an (f(x),m)-interleaved sequence is a sequence which is made of (or say,interleaved by) m component sequences with a common characteristic polynomial (f(x)(∈Fq [x]).In this note,(f(x),m)-interleaved sequences are studied further.As a result,it is made clear how their minimal characteristic polynomials,linear spans and periods are determined by their component sequences.And also,their period distribution and the number of (f(x),m)-interleaved sequences with maximal linear spans are derived.Furthermore,a large number of interleaved sequences with the lowest correlation among all the (f(x),m)-interleaved sequences are constructed.     

线性复杂度为2~n-2~m的2~n周期二元序列的4(或5)错误序列

线性复杂度和k错误线性复杂度是衡量密钥流序列随机性的两个重要标准.一条安全性强的序列不仅要有较高的线性复杂度和k错线误性复杂度,对数值较小的k,还应有较少的k错误序列.对k=4,5,讨论了线性复杂度为2n-2m的2n周期二元序列s的k错误序列的个数.     

空间位置记忆广度研究

 空间位置记忆广度是人对空间方位知觉能力和短时记忆能力的一种度量,对人的短时记忆容量研究有重要意义。本文设计了不同编码的两种实验,对100名大学生进行测试,记录测试结果,进行统计分析。主要研究了以下问题：人的空间位置记忆广度值与记忆的位数和出错的次数间是否具有某种关系;如果改变实验条件,空间位置记忆广度值是否就会有很大区别;不同性别的记忆广度值是否会有显著不同。实验结果表明,记忆广度与记忆位数和出错次数符合线性回归关系;不同编码形式的空间位置记忆广度存在显著差异;不同性别的空间位置记忆广度没有显著差异。     

线性同余伪随机序列的偏差估计

采用关于网格理论的方法，对线性同余序列及向量列在其作为伪随机序列模拟均匀分布时的偏差加以讨论并给出估计．     

关于二阶线性递归序列倒数和的对称性

设A和是B不等于0的实数,{wn}n∈z是二阶递归序列且满足递归关系:wn 2=Awn 1-Bwn(n∈z). 本文研究了二阶线性递归序列{wn}n∈z的倒数和的对称性,并且得出了关于{wn}n∈z的二个收敛的无穷级数,推广I.J.Good文中的主要结论.     

On the largest linear span of binary sequences with period p 2 from interleaved construction

Let S be a family of binary sequences constructed from interleaved construction. The linear spans of binary sequences in S are studied in this paper. In order to achieve the largest linear span, a criterion is presented for the base sequences with periodp, where p is a prime and 2 is a primitive root modulop2. It is shown that any sequence in S has the largest linear span under the criterion. Moreover, such base sequences can be chosen easily.     

The k-Error Linear Complexity and the Linear Complexity for pq^n-Periodic Binary Sequences

The k-error linear complexity and the linear complexity of the keystream of a stream cipher are two important standards to scale the randomness of the key stream. For a pq^n-periodic binary sequences where p, q are two odd primes satisfying that 2 is a primitive root module p and q^2 and gcd（p-1, q-1） = 2, we analyze the relationship between the linear complexity and the minimum value k for which the k-error linear complexity is strictly less than the linear complexity.     

Statistical Characteristics of the Complexity for Prime-Periodic Sequences

Using the fact that the factorization of x^N-1 over GF(2) is especially explicit, we completely establish the distributions and the expected values of the linear complexity and the k-error linear complexity of the N-periodic sequences respectively, where N is an odd prime and 2 is a primitive root modulo N. The results show that there are a large percentage of sequences with both the linear complexity and the k-error linear complexity not less than N, quite close to their maximum possible values.     

二元周期序列4-错误序列的研究

通过将周期为2n的二元序列的k-错线性复杂度的计算转化为求Hamming重量最小的错误序列的方法,研究序列的k-错线性复杂度的分布情况,讨论了序列不同k-错线性复杂度条件下对应的k-错误序列的分布情况。基于Games-Chan算法,给出了线性复杂度小于2n的2n周期二元序列的4-错线性复杂度分别为2n-1-(2m+2j)和2n-1-(2m+2j)+x情况下的4-错误序列的计数公式。同时,给出实例并使用计算机进行验证。     

P元周期倒序广义对偶多维序列的复杂性分析

线性复杂度是度量密钥流序列的重要指标。在P元周期倒序单序列的对偶序列极小多项式性质的基础上,讨论了P元周期倒序广义对偶多维序列的极小多项式的性质,并明确给出P元周期倒序广义对偶多维序列与原多维序列之间的联合线性复杂度的关系式。这些结果很好地推动了密钥流多维序列的联合线性复杂度研究的发展。     

周期二元序列的部分4-错误序列计数公式

k-错线性复杂度是度量密钥流序列的密码强度的一个重要指标.为了更好地刻画和研究序列的随机性,研究了周期为2n的二元序列s的k-错线性复杂度(LCk(s的分布情况,讨论了满足LCks)=LC(s+e)条件下的k-错误序列e的分布情况.基于Games-Chan算法,通过将k-错线性复杂度的计算转化为求Hamming重量最小的错误序列的方法,给出了线性复杂度小于2n的2n周期二元序列的部分4-错误序列的计数公式.     

关于二阶线性递归序列的一些恒等式

设ωn+2＝Aωn+2-Bωn(B≠0) (n＝0,±1,±2,…),我们完全确定了何时有恒等式ωpn+r＝nΣk＝0(nR)i n-kskωqk+r (n∈N＝{0,1,2…}).设u0＝0,u1＝1,且u+2＝Aun+1-Bun(n＝0,±1,±2,…),对l,m∈N及函数fN→{k∈Zωk≠0},我们证明了关于l,m对称的恒等式1-1Σk＝0Bf(k)uf(k+m)-f(k)ωf(k)ωf(k+m)＝m-1Σk＝0Bf(k)uf(k+l)-f(k)ωf(k)ωf(k+l)它可用于计算无穷级数+∞Σk＝0Bf(k)uf(k+m)-f(k)/(ωf(k)ωf(k+m).本文的结果推广了南献[1]、[2]、[3]、[7]、[8]中相关的工作.     

关于Moore的一个猜想

就整数ａ、ｂ的一般取值全面讨论了Ｆｉｂｏｎａｃｃｉ多项式序列Ｆ０（ｘ）＝ａ，Ｆ１（ｘ）＝ｘ＋ｂ，Ｆｎ（ｘ）＝ｘＦｎ－１（ｘ）＋Ｆｎ－２（ｘ）（ｎ≥２）的最大实根的渐近性质，否定了Ｇ．Ａ．Ｍｏｏｒｅ关于一般Ｆｉｂｏｎａｃｃｉ多项式序列的最大实根的渐近性质仅依赖于迭代关系Ｆｎ（ｘ）＝ｘＦｎ－１（ｘ）＋Ｆｎ－２（ｘ）而与初始条件Ｆ０（ｘ）、Ｆ１（ｘ）无关的猜想．     

一类线性递推数列求通项的特征根法的探讨

求线性递推数列的通项是高考中的重点和难点,此类问题的解法繁琐且易出错,本文探讨了常见的特征根法,给出了相关例子,说明其普遍性、实用性。     

关于二阶线性递归序列的加权和

设{wn}为二阶线性递归序列,n为整数.给出了关于二阶线性递归序列{wn}的加权和T(m)的定义,研究了二阶线性递归序列{wn}的加权和T(m),得到了关于加权和T(m)的一个公式,本文的主要结果推广了Kiyota Ozeki的一个结果.     

由混合序列生成的线性过程加权和的极限定理

假设线性过程Xt=∑〖DD(〗∞〖〗j=0〖DD)〗ajξt-j, t≥1, 其中{ξt,t∈Z}为一零均值的混合序列, {aj, j≥0}为一实数序列, 满足∑〖DD(〗∞〖〗j=0〖DD)〗j〖JB(|〗aj〖JB)|〗<∞, {ani,1≤i≤n,n≥1}为一实值的三角阵列, 在适当的假设条件下, 利用混合序列的中心极限定理及相应的概率不等式, 证明了由混合序列生成线性过程加权和的极限定理.     

L~p( [0, 1])-characterizations of multi-knot piecewise linear spectral sequences

There exists a class of new orthonormal basis for L2([0, 1]), whose exponential parts are multi-knot piecewisf linear functions called spectral sequences. In this paper, we show that these bases constitute bases, but not unconditional bases, for Lp([0, 1 ]) with 1相似文献   

一般二阶线性递归多项式的积分序列

将Jacobsthal多项式和Jacobsthal-Lucas多项式推广到了更一般的二阶线性递归多项式un(x)，vn(x)，研究了此多项式的积分序列Sn(x)=∫0^x un(s)ds和Tn(x)=∫0^x vn(s)ds，给出了它们的封闭表示，利用广义调和数，对数列Sn(1)，Tn(1)的性质作了较为全面的探讨。     

Lp(［0,1］)-characterizations of multi-knot piecewise linear spectral sequences

There exists a class of new orthonormal basis for L²(［0,1］), whose exponential parts are multi-knot piecewise linear functions called spectral sequences. In this paper, we show that these bases constitute bases, but not unconditional bases, for L^p(［0,1］) with 1＜p＜∞, p≠2. In addition, we give the corresponding convergence theorem in L^p, Carleson-Hunt theorem on almost everywhere convergence, Littlewood-Paley theorem and Poisson summation formula related to these bases.     

LPQD列生成线性过程部分和的精确渐近性

设{ε_t;t∈Z^{+}是一严平稳零均值的LPQD随机变量序列, 并且02₁<∞, σ2, 0<σ2<∞, {a_j; j∈N }是一实数序列, 定义线性过程X_t. 利用弱收敛定理和矩不等式, 对一般的拟权函数和边界函数, 证明了{M_n}和{S_n}的精确渐近性.}