剩余类环上LFSR序列乘积的线性复杂度

北京邮电大学学报 ›› 2001, Vol. 24 ›› Issue (2): 1-4.

• • 下一篇

剩余类环上LFSR序列乘积的线性复杂度

张春起, 杨义先, 蔡吉人

北京邮电大学信息工程学院, 北京 100876

收稿日期:2000-12-20 出版日期:2001-03-10
作者简介:张春起(1965—),男,博士生.
基金资助:
国家重点基础研究发展规划项目(973)资助(G1999035805).国家杰出青年基金.国家自然科学基金资助项目(69772035,69882002)

On the Linear Complexity of Products of LFSR Sequence on Residue Ring Z/(2^e)

ZHANG Chun-qi, YANG Yi-xian, CAI Ji-ren

Information Engineering School,Beijing University of Posts and Telecommunications,Beijing 100876, China

Received:2000-12-20 Online:2001-03-10

摘要/Abstract

摘要： 证明了剩余类环上LFSR序列乘积的线性复杂度小于线性复杂度的积.特别地,具有互素本原多项式的极大长序列乘积的线性复杂度等于线性复杂度的乘积.

关键词: 线性复杂度, 极大长序列, 算述结果

Abstract: It is proved that the linear complexity of the production sequence of two LFSR sequences is less than or equal to the production of the linear complexities of the two LFSR sequences.Especially, if these two LFSR sequences are m-sequences, and if their minimal polynomials are mutually prime, then the linear complexity of the production sequence of the two LFSR sequences equals the production of the two linear complexities.

Key words: linear complexity, maximum sequences, Arithmetic result

中图分类号:

TN911.22

张春起, 杨义先, 蔡吉人. 剩余类环上LFSR序列乘积的线性复杂度[J]. 北京邮电大学学报, 2001, 24(2): 1-4.

ZHANG Chun-qi, YANG Yi-xian, CAI Ji-ren. On the Linear Complexity of Products of LFSR Sequence on Residue Ring Z/(2^e)[J]. JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM, 2001, 24(2): 1-4.

剩余类环上LFSR序列乘积的线性复杂度

On the Linear Complexity of Products of LFSR Sequence on Residue Ring Z/(2^e)

PDF

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 1

编辑推荐

Metrics

本文评价

剩余类环上LFSR序列乘积的线性复杂度

On the Linear Complexity of Products of LFSR Sequence on Residue Ring Z/(2e)

PDF

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 1

编辑推荐

Metrics

本文评价

On the Linear Complexity of Products of LFSR Sequence on Residue Ring Z/(2^e)