引用本文: | 李超.GF(q)上多元多项式与钟控序列[J].国防科技大学学报,1993,15(4):66-70.[点击复制] |
Li Chao.Polynomial in Several Elements and Clock Controlled Sequences over GF (q)[J].Journal of National University of Defense Technology,1993,15(4):66-70[点击复制] |
|
|
|
本文已被:浏览 5086次 下载 4819次 |
GF(q)上多元多项式与钟控序列 |
李超 |
(系统工程与数学系)
|
摘要: |
本文讨论了有限域 GF(q)(q=pa,P≥2 为素数,α≥l 为正整数)上多元多项式与钟控序列的周期和线性复杂度的关系。当前馈函数 g(x1,x2,… ,xn)∈GF(q)[x1,x2,… ,xn]为一次多项式时.我们给出了钟控序列到达最大周期与线性复杂度的充要条件。 |
关键词: 有限域,钟控序列,多项式,周期,线性复杂度 |
DOI: |
投稿日期:1992-11-12 |
基金项目: |
|
Polynomial in Several Elements and Clock Controlled Sequences over GF (q) |
Li Chao |
(Department of System Engineering and Mathematics)
|
Abstract: |
In this paper, the relation among the polynomial in several elements and the period and linear complexity of the clock controlled sequences over the finite field GF(q)(q=pa,P≥2 is a prime number, a≥1 is a positive integer number)is discussed. When the n-pry polynomial g(x1,x2,…,xn) ∈GF(q)[x1,x2,… ,xn] is a polynomial of degree 1, we give the necessary and sufficient condition that the clock controlled sequences get to the maximum period and the maximum linear complexity. |
Keywords: polynomial,Period,finite field,clock controlled sequences,linear complexity |
|
|
|
|
|