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
相关论文
共 50 条
  • [1] Linear Difference Equations and Periodic Sequences over Finite Fields
    Dang Vu Giang
    ACTA MATHEMATICA VIETNAMICA, 2016, 41 (01) : 171 - 181
  • [2] Expansion complexity and linear complexity of sequences over finite fields
    László Mérai
    Harald Niederreiter
    Arne Winterhof
    Cryptography and Communications, 2017, 9 : 501 - 509
  • [3] Expansion complexity and linear complexity of sequences over finite fields
    Merai, Laszlo
    Niederreiter, Harald
    Winterhof, Arne
    CRYPTOGRAPHY AND COMMUNICATIONS-DISCRETE-STRUCTURES BOOLEAN FUNCTIONS AND SEQUENCES, 2017, 9 (04): : 501 - 509
  • [4] Linear Complexity Cubic Sequences over Finite Fields
    Edemskiy, Vladimir
    Sokolovskiy, Nikita
    PROCEEDINGS OF THE 3RD INTERNATIONAL CONFERENCE ON MATHEMATICS AND COMPUTERS IN SCIENCES AND IN INDUSTRY (MCSI 2016), 2016, : 57 - 60
  • [5] The Expansion Complexity of Ultimately Periodic Sequences Over Finite Fields
    Sun, Zhimin
    Zeng, Xiangyong
    Li, Chunlei
    Zhang, Yi
    Yi, Lin
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2021, 67 (11) : 7550 - 7560
  • [6] On the Complexity of Linear Algebra Operations over Algebraic Extension Fields
    Hashemi, Amir
    Lichtblau, Daniel
    COMPUTER ALGEBRA IN SCIENTIFIC COMPUTING, CASC 2023, 2023, 14139 : 141 - 161
  • [7] On the linear complexity of Sidel'nikov sequences over nonprime fields
    Brandstaetter, Nina
    Meidl, Wilfried
    JOURNAL OF COMPLEXITY, 2008, 24 (5-6) : 648 - 659
  • [8] A formula on linear complexity of highest coordinate sequences from maximal periodic sequences over Galois rings
    HU Lei and SUN Nigang (State Key Laboratory of Information Security
    Progress in Natural Science, 2006, (09) : 998 - 1001
  • [9] A formula on linear complexity of highest coordinate sequences from maximal periodic sequences over Galois rings
    Hu Lei
    Sun Nigang
    PROGRESS IN NATURAL SCIENCE-MATERIALS INTERNATIONAL, 2006, 16 (09) : 998 - 1001
  • [10] A Note on Constant Weight Sequences over q-Ary from Cyclic Difference Sets
    Kaida, Takayasu
    Zheng, Junru
    IWSDA'09: PROCEEDINGS OF THE FOURTH INTERNATIONAL WORKSHOP ON SIGNAL DESIGN AND ITS APPLICATIONS IN COMMUNICATIONS, 2009, : 112 - +
12345