Permutation polynomials, de Bruijn sequences, and linear complexity

被引:31
|
作者
Blackburn, SR [1 ]
Etzion, T [1 ]
Paterson, KG [1 ]
机构
[1] UNIV LONDON,ROYAL HOLLOWAY & BEDFORD NEW COLL,DEPT COMP SCI,EGHAM TW20 0EX,SURREY,ENGLAND
基金
英国工程与自然科学研究理事会;
关键词
D O I
10.1006/jcta.1996.0088
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
The paper establishes a connection between the theory of permutation polynomials and the question of whether a de Bruijn sequence over a general finite held of a given linear complexity exists. The connection is used both to construct span 1 de Bruijn sequences (permutations) of a range of linear complexities and to prove non-existence results for arbitrary spans. Upper and lower bounds for the linear complexity of a de Bruijn sequence of span n over a finite field are established. Constructions are given to show that the upper bound is always tight, and that the lower bound is also tight in many cases. (C) 1996 Academic Press, Inc.
引用
收藏
页码:55 / 82
页数:28
相关论文
共 50 条
  • [41] Construction of De Bruijn Sequences from l-sequences
    Li, Ming
    Jiang, Yupeng
    Lin, Dongdai
    2021 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2021, : 1522 - 1527
  • [43] Construction for de Bruijn sequences with large stage
    Dong, Junwu
    Pei, Dingyi
    DESIGNS CODES AND CRYPTOGRAPHY, 2017, 85 (02) : 343 - 358
  • [44] De Bruijn sequences, irreducible codes and cyclotomy
    Department of Informatics, University of Bergen, N-5020 Bergen, Norway
    Discrete Math, 1-3 (143-154):
  • [45] On the existence of balanced generalized de Bruijn sequences
    Baker, Matthew
    Mittal, Bhumika
    Mouli, Haran
    Tang, Eric
    DISCRETE MATHEMATICS, 2023, 346 (09)
  • [46] Extreme weight classes of de Bruijn sequences
    Mayhew, GL
    DISCRETE MATHEMATICS, 2002, 256 (1-2) : 495 - 497
  • [47] A recursive construction of nonbinary de Bruijn sequences
    Abbas Alhakim
    Mufutau Akinwande
    Designs, Codes and Cryptography, 2011, 60 : 155 - 169
  • [48] An interleaved method for constructing de Bruijn sequences
    Zhao, Xiao-Xin
    Tian, Tian
    Qi, Wen-Feng
    DISCRETE APPLIED MATHEMATICS, 2019, 254 : 234 - 245
  • [49] Generating De Bruijn sequences: An efficient implementation
    Annexstein, FS
    IEEE TRANSACTIONS ON COMPUTERS, 1997, 46 (02) : 198 - 200
  • [50] Extending de Bruijn sequences to larger alphabets
    Becher, Veronica
    Cortes, Lucas
    INFORMATION PROCESSING LETTERS, 2021, 168