The Linear Complexity of Some Binary Sequences With Three-Level Autocorrelation

被引：4
|
作者：
Wang, Qi [1 ]
机构：
[1] Hong Kong Univ Sci & Technol, Dept Comp Sci & Engn, Kowloon, Hong Kong, Peoples R China
来源：
IEEE TRANSACTIONS ON INFORMATION THEORY | 2010年 / 57卷 / 08期
关键词：
Almost difference set; autocorrelation; difference set; GMW difference set; linear complexity; Singer difference set; DIFFERENCE SETS;
D O I：
10.1109/TIT.2010.2050831
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
Binary sequences with good autocorrelation are needed in many applications. A construction of binary sequences with three-level autocorrelation was recently presented. This construction is generic and powerful in the sense that many classes of binary sequences with three-level autocorrelation could be obtained from any difference set with Singer parameters. The objective of this paper is to determine both the linear complexity and the minimal polynomial of two classes of binary sequences, i.e., the class based on the Singer difference set, and the class based on the GMW difference set.
引用
收藏
页码：4046 / 4052
页数：7
相关论文
共 50 条
  • [1] The Linear Complexity of a Class of Binary Sequences with Three-Level Autocorrelation
    Sun, Yuhua
    Yan, Tongjiang
    Li, Hui
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2013, E96A (07) : 1586 - 1592
  • [2] The linear complexity of binary sequences of length 2p with optimal three-level autocorrelation
    Edemskiy, V.
    Palvinskiy, A.
    INFORMATION PROCESSING LETTERS, 2016, 116 (02) : 153 - 156
  • [3] Several classes of binary sequences with three-level autocorrelation
    Ding, CS
    Helleseth, T
    Lam, KY
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1999, 45 (07) : 2606 - 2612
  • [4] New families of binary sequences with optimal three-level autocorrelation
    Ding, CS
    Helleseth, T
    Martinsen, H
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2001, 47 (01) : 428 - 433
  • [5] The Linear Complexity of Binary Sequences With Optimal Autocorrelation
    Wang, Qi
    Du, Xiaoni
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2010, 56 (12) : 6388 - 6397
  • [6] The Linear Complexity of Binary Sequences with Optimal Autocorrelation
    Wang, Qi
    Du, Xiaoni
    2010 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, 2010, : 1228 - 1232
  • [7] The linear complexity of a class of binary sequences with optimal autocorrelation
    Cuiling Fan
    Designs, Codes and Cryptography, 2018, 86 : 2441 - 2450
  • [8] The linear complexity of a class of binary sequences with optimal autocorrelation
    Fan, Cuiling
    DESIGNS CODES AND CRYPTOGRAPHY, 2018, 86 (10) : 2441 - 2450
  • [9] Binary sequences with three and four level autocorrelation
    Cai, Ying
    Han, Zhen
    COMPUTATIONAL INTELLIGENCE AND SECURITY, 2007, 4456 : 435 - 442
  • [10] Binary sequences with three and four level autocorrelation
    Cai, Ying
    Han, Zhen
    2006 INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND SECURITY, PTS 1 AND 2, PROCEEDINGS, 2006, : 1319 - 1322
12345