On Linear Complexity of Periodic Sequences over Extension Fields from Cyclic Difference Sets

被引:0
作者
Kaida, Takayasu [1 ]
Zheng, Junru [2 ]
机构
[1] Kinki Univ, Dept Informat & Comp Sci, Fac Humanity Oriented Sci & Engn, Iizuka, Fukuoka 8208555, Japan
[2] Kyushu Womens Univ, Dept Human Dev, Fac Humanities, Kitakyushu, Fukuoka 8078586, Japan
来源
2015 SEVENTH INTERNATIONAL WORKSHOP ON SIGNAL DESIGN AND ITS APPLICATIONS IN COMMUNICATIONS (IWSDA) | 2015年
关键词
pseudo-random sequence; multi-valued sequence; cyclic difference set; linear complexity; constant weight property; balanced property;
D O I
暂无
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
The set of constant-weight sequences over GF(q) from the cyclic difference set generalized by the authors are considered. For the linear complexity(LC) of infinite sequences with their one period as an element in the set, we give a conjecture that LCs of all sequences except two in the set are the maximum as same as their period and LCs of remaining two sequences are the maximum value minus one. Five numerical examples over two prime fields and three non-prime(extension) fields are shown for evidences of main conjecture in this paper.
引用
收藏
页码:15 / 18
页数:4
相关论文
共 13 条
[1]  
[Anonymous], 1971, CYCLIC DIFFERENCE SE
[2]  
Golomb S. W., 2005, Signal Design for Good Correlation: For Wireless Communication, Cryptography, and Radar
[3]   A SIMPLE DERIVATION OF THE BERLEKAMP MASSEY ALGORITHM AND SOME APPLICATIONS [J].
IMAMURA, K ;
YOSHIDA, W .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1987, 33 (01) :146-150
[4]  
Kaida T., 2014, P 2014 INT S INF THE, P735
[5]  
Kaida T., 2010, P 2010 INF THEOR WOR
[6]  
Kaida T., 2014, P 2014 S CRYPT INF S
[7]  
Kaida T., 2013, P 36 S INF THEOR ITS, P70
[8]  
Kaida T., 2015, IT201494ISEC2014107W
[9]  
Kaida T, 2013, INT WORK SIG DES, P36, DOI 10.1109/IWSDA.2013.6849056
[10]   On Constant-Weight Multi-Valued Sequences from Cyclic Difference Sets [J].
Kaida, Takayasu ;
Zheng, Junru .
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2013, E96A (01) :171-176