两类周期为pq的四元序列在F_(4)上的线性复杂度  

LINEAR COMPLEXITYOFTWOCLASSESOFQUATERNARY SEQUENCES WITHPERIOD pq OVER F_(4)

作　　者：颜霏霏 柯品惠 YAN Fei-fei;KE Pin-hui(School of Mathematics and Statistics,Fujian Normal University,Fuzhou 350117,China;Key Laboratory of Analytical Mathematics and Applications of Ministry of Education(Fujian Normal University),Fuzhou 350117,China)

机构地区：[1]福建师范大学数学与统计学院,福建福州350117 [2]分析数学及应用教育部重点实验室(福建师范大学),福建福州350117

出　　处：《数学杂志》2025年第2期151-160,共10页Journal of Mathematics

基　　金：国家自然科学基金资助项目(62272420);福建省自然科学基金资助项目(2023J01535).

摘　　要：本文研究了两类周期为pq的四元序列在F_(4)上的线性复杂度和极小多项式.利用[10,12]中的方法,证明了这两类序列在F_(4)上具有高的线性复杂度,从而可以抵抗Berlekamp-Massey算法的攻击.In this paper,the linear complexity and minimal polynomial of two classes of quaternary sequences with period pq over F_(4) are investigated.By using the method of[10,12],it is proved that these two classes of sequences have high linear complexity over F_(4) and thus can resist Berlekamp-Massey algorithm attack.

关 键 词：逆Gray映射 广义分圆 四元序列 线性复杂度 

分 类 号：O236.2[理学—运筹学与控制论]