Linear complexity of quaternary sequences with odd period and low autocorrelation

被引：0

作者：

KE Pin-hui ^{[1
]}

LIN Chang-lu ^{[1
]}

ZHANG Sheng-yuan ^{[1
]}

机构：

[1] Fujian Provincial Key Laboratory of Network Security and Cryptology,Fujian Normal University

来源：

The Journal of China Universities of Posts and Telecommunications | 2014年 / 05期

基金：

中国国家自然科学基金;

关键词：

quaternary sequences; linear complexity; cyclotomy;

D O I：

暂无

中图分类号：

TN918.1 [理论];

学科分类号：

070104 ;

摘要：

Equivalence between two classes of quaternary sequences with odd period and best known autocorrelation are proved. A lower bound on the linear complexity of these sequences is presented. It is shown that the quaternary sequences have large linear complexity to resist Reeds and Sloane algorithm attack effectively.

引用

页码：89 / 93

页数：5

共 3 条

[1] New M\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$M$$\end{document}-ary sequences with low autocorrelation from interleaved technique
Nian Li
Xiaohu Tang
Tor Helleseth
[J]. Designs, Codes and Cryptography, 2014, 73 (1) : 237 - 249
[2] Polyphase power–residue sequences[J] . Green D. H.,Green P. R.. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences . 2003 (2032)
[3] Generalized GMW quadriphase sequences satisfying the Welch bound with equality
Udaya, P
Siddiqi, MU
[J]. APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING, 2000, 10 (03) : 203 - 225

← 1 →