南京林业大学学报（自然科学版）2012，Vol.36Issue(5)：145-147,3.
周期为pn+1的GF(q)上广义分圆序列的线性复杂度
The linear complexity of pn+1-periodic generalized cyclotomic sequence over GF(q)
摘要
Abstract
This paper mainly researched the linear complexity of pn+1 -periodic generalized cyclotomic sequences, which generalize Edemskii's results which is mentioned in the first reference from binary field to GF(q). In this paper,cyclotomic number and sums of partial index number will be used to give concrete computation equation of the linear complexity.关键词
广义分圆序列/线性复杂度/本原单位根Key words
generalized cyclotomic sequence/ linear complexity/ primitive root of unity分类
数理科学引用本文复制引用
胡传方,岳勤..周期为pn+1的GF(q)上广义分圆序列的线性复杂度[J].南京林业大学学报（自然科学版）,2012,36(5):145-147,3.基金项目
国家自然科学基金项目(10971250,11171150) （10971250,11171150）
