计算机工程
計算機工程
계산궤공정
COMPUTER ENGINEERING
2010年
3期
22-23,27
,共3页
Galois环%最高权位序列%线性复杂度%相关性
Galois環%最高權位序列%線性複雜度%相關性
Galois배%최고권위서렬%선성복잡도%상관성
Galois ring%highest coordinate sequence%linear complexities%correlation
利用环Z_(p~2)上广义Kerdock码的最高权位生成了一类P元最高权位序列,并对其密码特性进行研究.给出序列线性复杂度的准确计算公式,利用Galois环上的Weil指数和估计对序列的互相关性及非同步自相关性进行刻画.实验结果表明,构造的最高权位序列具有大的线性复杂度和极低的互相关性及非同步自相关性,可作为CDMA通信系统中的码序列.
利用環Z_(p~2)上廣義Kerdock碼的最高權位生成瞭一類P元最高權位序列,併對其密碼特性進行研究.給齣序列線性複雜度的準確計算公式,利用Galois環上的Weil指數和估計對序列的互相關性及非同步自相關性進行刻畫.實驗結果錶明,構造的最高權位序列具有大的線性複雜度和極低的互相關性及非同步自相關性,可作為CDMA通信繫統中的碼序列.
이용배Z_(p~2)상엄의Kerdock마적최고권위생성료일류P원최고권위서렬,병대기밀마특성진행연구.급출서렬선성복잡도적준학계산공식,이용Galois배상적Weil지수화고계대서렬적호상관성급비동보자상관성진행각화.실험결과표명,구조적최고권위서렬구유대적선성복잡도화겁저적호상관성급비동보자상관성,가작위CDMA통신계통중적마서렬.
A new family of p-phase highest coordinate sequences. is constructed by using the highest coordinate of the generalized Kerdock codes over the ring Z_(p~2).This paper not only deduces an exact formula on the linear complexities of the sequences,but also derives an estimate of the correlation of the sequences by utilizing the Weil exponential sums over Galois rings. Results shows that these sequences have both large linear complexities and low crosscorrelation and nontrivial autocorrelation,which make it possible to be the code sequences in CDMA communication systems.
