检索结果-内蒙古大学图书馆

9th International Conference of Information and Communication Technology [ICICT]

作者： Wang, Xiao Lin Zhou, Jian Qin Anhui Univ Technol Sch Comp Sci & Technol Maanshan 243032 Peoples R China

In this paper, the method of calculating the k-variance linear complexity distribution with 2(n)-periodical sequences by the Games-Chan algorithm and sieve approach is affirmed for its generality. The main idea of this method is to decompose a binary sequence into some subsequences of critical requirements, hence the issue to find k-variance linear complexity distribution with 2(n)-periodical sequences becomes a combinatorial problem of these binary subsequences. As a result, we compute the whole calculating formulas on the k-variance linear complexity with 2(n)-periodical sequences of linear complexity less than 2(n) for k = 4, 5. With combination of results in the whole calculating formulas on the 3-variance linear complexity with 2(n)-periodical binary sequences of linear complexity 2(n), we completely solve the problem of the calculating function distributions of 4-variance linear complexity with 2(n)-periodical sequences elegantly, which significantly improves the results in the relating references. (C) 2019 The Authors. Published by Elsevier Ltd.

关键词： Periodical binary sequence linear complexity k-variance linear complexity distribution

来源：评论

学校读者我要写书评

暂无评论

The 4-variance linear complexity distribution with 2 n -Periodical Binary Sequences

引用

Procedia Computer Science 2019年 154卷 389-399页

作者： Xiao Lin Wang Jian Qin Zhou School of Computer Science and Technology Anhui University of Technology Ma’anshan 243032 China

In this paper, the method of calculating the k-variance linear complexity distribution with 2 n -periodical sequences by the Games-Chan algorithm and sieve approach is affirmed for its generality. The main idea of this method is to decompose a binary sequence into some subsequences of critical requirements, hence the issue to find k-variance linear complexity distribution with 2 n -periodical sequences becomes a combinatorial problem of these binary subsequences. As a result, we compute the whole calculating formulas on the k-variance linear complexity with 2 n -periodical sequences of linear complexity less than 2 n for k = 4, 5. With combination of results in the whole calculating formulas on the 3-variance linear complexity with 2 n -periodical binary sequences of linear complexity 2 n , we completely solve the problem of the calculating function distributions of 4-variance linear complexity with 2 n -periodical sequences elegantly, which significantly improves the results in the relating references.

关键词： Periodical binary sequence linear complexity k-variance linear complexity distribution

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：