An algorithm for k-error joint linear complexity of binary multi-sequences

被引：1
|
作者：
Sethumadhavan, M. [1 ]
Sindhu, M. [1 ]
Srinivasan, Chungath [1 ]
Kavitha, C. [1 ]
机构：
[1] Amrita Vishwa Vidyapeetham, Coimbatore, Tamil Nadu, India
来源：
JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY | 2008年 / 11卷 / 03期
关键词：
Multisequences; k-error joint linear complexity; balanced multisequences;
D O I：
10.1080/09720529.2008.10698185
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
Our aim is to find some of the analogues of results related to k-error linear complexity of single sequences to the case of multisequences over GF(2). This paper presents algorithms for finding the joint linear complexity and the k-error joint linear complexity of m-fold binary multisequences of period 2(n).
引用
收藏
页码：297 / 304
页数：8
相关论文
共 50 条
  • [31] ON k-ERROR LINEAR COMPLEXITY OF PSEUDORANDOM BINARY SEQUENCES DERIVED FROM EULER QUOTIENTS
    Chen, Zhixiong
    Edemskiy, Vladimir
    Ke, Pinhui
    Wu, Chenhuang
    ADVANCES IN MATHEMATICS OF COMMUNICATIONS, 2018, 12 (04) : 805 - 816
  • [32] Periodic Sequences with Maximal Linear Complexity and Large k-Error Linear Complexity
    Wilfried Meidl
    Harald Niederreiter
    Applicable Algebra in Engineering, Communication and Computing, 2003, 14 : 273 - 286
  • [33] Determining the k-error joint linear complexity spectrum for a binary multisequence with period pn
    Fulin Li
    Shixin Zhu
    Honggang Hu
    Ting Jiang
    Cryptography and Communications, 2016, 8 : 513 - 523
  • [34] Determining the k-error joint linear complexity spectrum for a binary multisequence with period pn
    Li, Fulin
    Zhu, Shixin
    Hu, Honggang
    Jiang, Ting
    CRYPTOGRAPHY AND COMMUNICATIONS-DISCRETE-STRUCTURES BOOLEAN FUNCTIONS AND SEQUENCES, 2016, 8 (04): : 513 - 523
  • [35] Periodic sequences with maximal linear complexity and almost maximal k-error linear complexity
    Niederreiter, H
    Shparlinski, IE
    CRYPTOGRAPHY AND CODING, PROCEEDINGS, 2003, 2898 : 183 - 189
  • [36] ON THE k-ERROR LINEAR COMPLEXITY OF SEQUENCES FROM FUNCTION FIELDS
    Zhou, Yuhui
    Han, Yuhui
    Ding, Yang
    BULLETIN OF THE AUSTRALIAN MATHEMATICAL SOCIETY, 2020, 102 (02) : 342 - 352
  • [37] On the k-error linear complexity of 2p~2-periodic binary sequences
    Zhihua NIU
    Can YUAN
    Zhixiong CHEN
    Xiaoni DU
    Tao ZHANG
    ScienceChina(InformationSciences), 2020, 63 (09) : 263 - 276
  • [38] ON THE k-ERROR LINEAR COMPLEXITY FOR pn-PERIODIC BINARY SEQUENCES VIA HYPERCUBE THEORY
    Zhou, Jianqin
    Liu, Wanquan
    Wang, Xifeng
    Zhou, Guanglu
    MATHEMATICAL FOUNDATIONS OF COMPUTING, 2019, 2 (04): : 279 - 297
  • [39] On the k-Error Linear Complexity of Binary Sequences Derived from the Discrete Logarithm in Finite Fields
    Chen, Zhixiong
    Wang, Qiuyan
    COMPLEXITY, 2019, 2019
  • [40] Counting Functions for the k-Error Linear Complexity of 2n-Periodic Binary Sequences
    Kavuluru, Ramakanth
    Klapper, Andrew
    SELECTED AREAS IN CRYPTOGRAPHY, 2009, 5381 : 151 - 164
12345