摘要
本文利用Blabut定理给出一个周期序列的线性复杂性与此序列经DFT后的Hamming重量之间的关系。对某些序列a,b,完全刻画了它们的乘积序列a·b的线性复杂性。
By means of Blahut theorem,the relationship between the linear complexity of a periodic sequence and the Hamming weight of its DFT transformed serquence is explored. For some sequences a, b, we have characterized the linear complexity of the product sequence ab.
出处
《电子学报》
EI
CAS
CSCD
北大核心
1990年第5期117-120,共4页
Acta Electronica Sinica