On the linear complexity of interleaved binary sequences of period 4p obtained from hall sequences or legendre and hall sequences
On the linear complexity of interleaved binary sequences of period 4p obtained from hall sequences or legendre and hall sequences
复制标题
DOI：
10.1049/el.2014.0568
复制
发表时间：
2014-04
影响因子：
1.1
通讯作者：
V. Edemskiy
中科院分区：
文献类型：
--
作者：
V. Edemskiy
在某些通信系统和密码学中，需要具有最佳自相关特性和大线性复杂度的序列。Tang和Ding得到了一类新的具有最佳自相关值的几乎平衡二元序列。本文研究了由Hall序列或Legendre和Hall序列用Tang和Ding的方法得到的周期为4p的交错二元序列何时具有高的线性复杂度。
Sequences with an optimal autocorrelation property and with large linear complexity are needed in certain communication systems and cryptography. Tang and Ding obtained new classes of almost balanced binary sequences with an optimal autocorrelation value. In this reported work, it is explored as to when interleaved binary sequences of period 4p obtained by Tang and Ding's technique from Hall sequences or Legendre and Hall sequences possess high linear complexity.