CONSTRUCTING AND ANALYZING A CLASS OF CONTROLLABLE SEQUENCES  

CONSTRUCTING AND ANALYZING A CLASS OF CONTROLLABLE SEQUENCES

在线阅读下载全文

作  者:冯登国 肖国镇 

机构地区:[1]Institute of Information Security, Xidian University, Xi'an 710071

出  处:《Journal of Electronics(China)》1995年第3期259-263,共5页电子科学学刊(英文版)

摘  要:By using m-sequence over the finite field GF(2m) of degree L to control m-sequence over GF(2m) of degree L, a class of periodic sequences with large linear complexity is constructed. The lower bounds of the linear complexity of these sequences are L((L +1)m-Lm).By using m-sequence over the finite field GF(2m) of degree L to control m-sequence over GF(2m) of degree L, a class of periodic sequences with large linear complexity is constructed. The lower bounds of the linear complexity of these sequences are L((L +1)m-Lm).

关 键 词:Linear COMPLEXITY CONTROLLABLE sequence Feedback POLYNOMIAL 

分 类 号:TN911.2[电子电信—通信与信息系统]

 

参考文献:

正在载入数据...

 

二级参考文献:

正在载入数据...

 

耦合文献:

正在载入数据...

 

引证文献:

正在载入数据...

 

二级引证文献:

正在载入数据...

 

同被引文献:

正在载入数据...

 

相关期刊文献:

正在载入数据...

相关的主题
相关的作者对象
相关的机构对象