Reducing the Computation of the linear complexity of upv -periodic sequences

摘要：

We present a fast algorithm that reduced the computation of the linear complexity of the e upv -periodic 1 sequence under gcd(u,p) 1 to the computation of maximum of some linear complexities of pv -periodic sequences over p F. After combining with the Berlekamp-Massy algorithm or generalized Games-Chan algorithm, we could efficiently compute the linear complexity of pv -periodic sequence. Thus we present an efficient and attractive algorithm for calculating the linear complexity of upv -periodic sequences.

作者: Zheng-qing Jiang Li-yan zhu

作者单位: Sino-Korean School of Multimedia design, Shanghai University of Engineering Science,Shanghai,200336, Company of Shanghai Atlas Tiger Medical Information System Co.Ltd, Shanghai Province 200335,China

会议类型: 国际会议

会议名称: 2011 IEEE 18th International Conference on Industrial Engineering and Engineering Management(2011 IEEE 第十八届工业工程与工程管理国际会议 IEEM2011)

会议地点: 长春

会议语种:英文

页码: 1273-1277

在线出版日期: 2011-09-03（万方平台首次上网日期，不代表论文的发表时间）