Linear complexity of polylinear sequences

被引:0
|
作者
Kurakin, V.L.
机构
来源
Discrete Mathematics and Applications | 2001年 / 11卷 / 01期
关键词
D O I
暂无
中图分类号
学科分类号
摘要
引用
收藏
页码:1 / 51
相关论文
共 50 条
  • [31] Bound for linear complexity of BBS sequences
    Vitini, FM
    Masque, JM
    Dominguez, AP
    ELECTRONICS LETTERS, 1998, 34 (05) : 450 - 451
  • [32] 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
  • [33] Linear Complexity and Expansion Complexity of Some Number Theoretic Sequences
    Hofer, Richard
    Winterhof, Arne
    ARITHMETIC OF FINITE FIELDS, WAIFI 2016, 2016, 10064 : 67 - 74
  • [34] 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
  • [35] Linear complexity of generalized sequences by comparison of PN-sequences
    Fuster-Sabater, Amparo
    Cardell, Sara D.
    REVISTA DE LA REAL ACADEMIA DE CIENCIAS EXACTAS FISICAS Y NATURALES SERIE A-MATEMATICAS, 2020, 114 (02)
  • [36] Linear complexity of generalized sequences by comparison of PN-sequences
    Amparo Fúster-Sabater
    Sara D. Cardell
    Revista de la Real Academia de Ciencias Exactas, Físicas y Naturales. Serie A. Matemáticas, 2020, 114
  • [37] Periodic sequences with maximal linear complexity and large k-error linear complexity
    Meidl, W
    Niederreiter, H
    APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING, 2003, 14 (04) : 273 - 286
  • [38] On the expected value of the linear complexity and the k-error linear complexity of periodic sequences
    Meidl, W
    Niederreiter, H
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2002, 48 (11) : 2817 - 2825
  • [39] 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
  • [40] Joint linear complexity of multisequences consisting of linear recurring sequences
    Fu, Fang-Wei
    Niederreiter, Harald
    Ozbudak, Ferruh
    CRYPTOGRAPHY AND COMMUNICATIONS-DISCRETE-STRUCTURES BOOLEAN FUNCTIONS AND SEQUENCES, 2009, 1 (01): : 3 - 29