摘要
证明了剩余类环上 L FSR序列乘积的线性复杂度小于线性复杂度的积 .特别地 ,具有互素本原多项式的极大长序列乘积的线性复杂度等于线性复杂度的乘积 .
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.
出处
《北京邮电大学学报》
EI
CAS
CSCD
北大核心
2001年第2期1-4,共4页
Journal of Beijing University of Posts and Telecommunications
基金
国家重点基础研究发展规划项目!( 973 )资助 ( G1 9990 3 580 5)
国家杰出青年基金
国家自然科学基金资助项目!( 69772 0 3 5
6988