几何序列与拟广义几何序列的互相关函数

本文构造了一类与几何序列的互相关特性非常好的新序列－拟广义几何序列。     

广义差集与几乎完美序列

提出了广义差集的概念,并且给出了广义差集的一些初等性质.从应用的角度讲,广义差集就是使得其±1特征序列的自相关函数是(最多)三值的一种组合结构.因此,广义差集不仅仅是在概念(理论)上的推广,它还具有深层次的应用背景.事实上,给出了一些广义差集,它不是可分差集,也不是相对差集.同时也给出了一类广义差集存在的一些必要条件,使得这些广义差集对应的±1特征序列成为几乎完美序列.并举例说明本文中的方法是有效的.     

平稳序列自相关函数正定的充要条件

本文导出了平稳序列的自相关函数Ｂ（τ）为正定的充分必要条件，并说明了ＡＲＭＡ（ｐ，ｑ）序列的Ｂ（τ）总是正定的     

拟共形形变边界值的局部和整体性质

给定单位圆周Г上的 Ｚｙｇｍｕｎｄ函数ｆ（　）， ｂ（ｆ）及 ｂ　（ｆ）分别是ｆ的边界模及其在 ∈Г处的局部边界模．本文将证明ｂ（ｆ）＝ｍａｘｂ　（ｆ），讨论ｆ的退化Ｈａｍｉｌｔｏｎ序列，并给出ｂ（ｆ）＝０的一些等价刻划．     

拟Bent函数

参考文献 [1 ]中首次提出了拟 Bent函数的概念 .在本文中 ,我们进一步研究了这一类函数的性质及它与 Bent函数的关系 .当 n=4时 ,我们比较详尽地讨论了把它作为密码函数来运用的密码性质     

二元序列的自相关函数和游程的一些结果

给出了二元周期序列的自相关性质与其游程性质之间的关系,作为一个应用,我们给出了周期为1 2的零自相关窗大于等于6的所有序列.     

拟Bent函数的性质和构造

本文将基本2-群中拟Bent函数的概念推广到一般的有限Abel群中,统一了目前几乎所有的Bent函数概念,完全刻画了一类拟Bent函数和Bent函数的本质联系,给出了几种拟Bent函数的构造方法,拟Bent函数和相对差集的一种关系以及一种用拟Bent函数构造Bent函数的方法.最后,利用Galois环和组合集,找到一类拟Bent函数.     

时间序列中自相关与偏相关函数分析

相关函数表现出时间序列中任意两个值之间的相关性是如何随着时间间隔而改变的.自相关函数刻画了时间序列相邻变量之间的相关性,偏相关函数则是排除了其它中间变量的影响,真实地反映两个变量之间的相关性,并且二者紧密相连.同时两个相关图所反映的信息在时间序列分析各个方面发挥着关键作用.     

一类基于m序列码的阵列码

通过对阵列 H码和 m序列码的分析 ,本文证明了阵列 H码中的一类正规 H码与 m序列码间的关系     

逆自相关函数估计的渐近性质

逆自相关函数估计的渐近性质陈敏，常学将（山西大学数学系，太原０３０００６）ＴＨＥＡＳＹＭＰＴＯＴＩＣＰＲＯＰＥＲＴＩＥＳＯＦＴＨＥＥＳＴＩＭＡＴＩＯＮＯＦＴＨＥＩＮＶＥＲＳＥＣＯＲＲＥＬＡＴＩＯＮＦＵＮＣＴＩＯＮ￥ＣＨＥＮＭＩＮ；ＣＨＡＮＧＸＵＥＪＩ...     

Statistical Weakness of Multiplexed Sequences

It is proved that the out-of-phase autocorrelation of a well-known class of multiplexed sequences for cryptographic and spread spectrum applications is necessarily high for relatively small values of the phase shifts. Related design criteria for the multiplexer generator including the use of full positive difference sets are proposed. By generalizing the classical occupancy problem, higher order statistical weaknesses of multiplexed sequences are also established.     

Answering a Question of Pott on Almost Perfect Sequences

Periodic binary (plus-minus) sequences all but one of whose out-of-phase autocorrelation coefficients are zero are studied by Wolfman [6]. Using the equivalence of these almost perfect sequences to certain cyclic divisible difference sets (noted by Bradley and Pott [1]), we settle the existence status of a perviously open case of an almost perfect sequence of length 852, thereby answering a question of Pott [5] negatively.     

Note on Periodic Complementary Sets of Binary Sequences

Denote by $PCS_p^n $ resp. $ACS_p^n $ thecollection consisting of ordered p-tuples of binary sequences(i.e., sequences whose elements are $ \pm 1$ ), each having length n, such that the sum of their periodic resp. aperiodicauto-correlation functions is a delta function. We fill many open cases inthe Bömer and Antweiler diagram [3] of the known cases where $PCS_p^n $ exist for $p \leqslant 12$ and $n \leqslant 50$ . In particular we show that $PCS_2^{34} $ exist, whileit is well known [1] that $ACS_2^{34} $ do not.     

伽罗瓦环上的一类No序列的构造

近年来,伽罗瓦环上的序列理论成为人们研究的热点问题.有限域上的No序列是一类伪随机序列,它在序列密码中占具十分重要的角色.本文利用伽罗瓦环上的置换,构造了伽罗瓦环Z_(p~e)上的一类新的No序列,并且研究了其线性复杂度.研究的结果表明此类No序列具有相当大的线性复杂度.     

Cross-Correlations of Quadratic Form Sequences in Odd Characteristic

Cross-correlation functions are determined for a large class of geometric sequences based on m-sequences in odd characteristic. These sequences are shown to have low cross-correlation values in certain cases. They also have significantly higher linear spans than previously studied geometric sequences. These results show that geometric sequences are candidates for use in spread-spectrum communications systems in which cryptographic security is a factor.     

Turyn‐Type Sequences: Classification,Enumeration, and Construction

Turyn‐type sequences, , are quadruples of ‐sequences , with lengths , respectively, where the sum of the nonperiodic autocorrelation functions of and twice that of is a δ‐function (i.e., vanishes everywhere except at 0). Turyn‐type sequences are known to exist for all even n not larger than 36. We introduce a definition of equivalence to construct a canonical form for in general. By using this canonical form, we enumerate the equivalence classes of for . We also construct the first example of Turyn‐type sequences .     

Exhaustive determination of (1023, 511, 255)-cyclic difference sets

An exhaustive search for (1023, 511, 255)-cyclic difference sets has been conducted. A total of 10 non-equivalent (1023, 511, 255)-cyclic difference sets have been found, all of which are members of previously known or conjectured infinite families. A fast and effective autocorrelation test method was utilized that can also facilitate the testing of longer sequences.

     

On Almost-Periodic Operators in the Spaces of Sequences

We study some properties of almost-periodic operators in the spaces l ^p and the spaces of Bohr and Besicovich almost-periodic sequences.