A Relationship Between Autocorrelation and Linear Complexity

GAO Jun-tao; HU Yu-pu; LI Xue-lian

您当前的位置：

首页 >

文章列表页 >

A Relationship Between Autocorrelation and Linear Complexity

更新时间：2025-07-16

- A Relationship Between Autocorrelation and Linear Complexity
- Acta Electronica Sinica Vol. 34, Issue 8, Pages: 1401-1404(2006)
- 作者机构：
  
  1. 西安电子科技大学计算机网络与信息安全教育部重点实验室,陕西,西安,710071
  2. 西安电子科技大学应用数学系,陕西,西安,710071
  3. 西安电子科技大学计算机网络与信息安全教育部重点实验室陕西西安,710071
  4. 西安电子科技大学应用数学系陕西西安,710071
- 作者简介：
- 基金信息：
- DOI：
  CLC： TN918.1
- Published：2006
- 稿件说明：
移动端阅览
GAO Jun-tao, HU Yu-pu, LI Xue-lian. A Relationship Between Autocorrelation and Linear Complexity[J]. Acta Electronica Sinica, 2006, 34(8): 1401-1404.
DOI：

GAO Jun-tao, HU Yu-pu, LI Xue-lian. A Relationship Between Autocorrelation and Linear Complexity[J]. Acta Electronica Sinica, 2006, 34(8): 1401-1404. DOI：

摘要

自相关性和线性复杂度是衡量序列伪随机性质的两个独立的指标.针对周期为2

emn的伪随机序列

本文首次指出了自相关性和线性复杂度之间存在的一个关系.该关系可应用于以下两个方面:(1)由序列的线性复杂度来估计/确定序列的自相关函数值;(2)通过线性复杂度来检验给定序列族的互相关性质.进一步的

针对一类周期为2

emn的伪随机序列

我们指出这类序列的自相关函数值和线性复杂度以及

-错线性复杂度存在着关系.

Abstract

Autocorrelation and linear complexity are two independent criterions for measuring the pseudorandom properties of sequences.For the 2

emn-periodic pseudorandom sequences

we first present the relationship between autocorrelation and linear complexity.The relationship can be applied in the following two aspects:(1)Estimating/Evaluating the value of autocorrelation functions by the linear complexity;(2)Evaluating the correlation of a given sequence family by the linear complexity.Furthermore

for a sort of sequences with period 2

emn

we denote that the autocorrelation is related to linear complexity and

-error linear complexity.

关键词

Keywords

references

Views

848

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

The 4-Error Linear Complexity of Binary Periodic Sequences

An Efficient Algorithm for Determining the k-Error Linear Complexity of Periodic Sequences

A Note on Trace Representation of Legendre Sequences

The Linear Complexity of the Generalized Self-Shrinking Generator on GF(q)

On the k-Error Linear Complexity of Binary Period Sequences

Related Author

QI Wen-feng

PI Fei

WEI Shi-min

CHEN Zhi-xiong

DU Xiao-ni

WANG Jin-ling

WANG Hui-juan

QI Wen-feng

Related Institution

State Key Laboratory of Information SecurityChinese Academy of SciencesBeijing 100190China

Department of Applied MathematicsInformation Engineering InstituteInformation Engineering UniversityZhengzhouHenan 450002China

State Key Laboratory of Information Security,Chinese Academy of Sciences

Department of Applied Mathematics,Information Engineering Institute,Information Engineering University

淮北煤炭师范学院计算机科学与技术系

⁰