Cycle Structure and Adjacency Graphs of a Class of LFSRs and a New Family of De Bruijn Cycles

被引:2
|
作者
Wang, Xiaofang [1 ,2 ]
Jiang, Linzhi [3 ]
机构
[1] Xidian Univ, State Key Lab Integrated Serv Networks, Xian 710071, Shaanxi, Peoples R China
[2] Chinese Acad Sci, Inst Informat Engn, State Key Lab Informat Secur, Beijing 100093, Peoples R China
[3] Univ Elect Sci & Technol China, Sch Comp Sci & Engn, Chengdu 611731, Sichuan, Peoples R China
来源
IEEE ACCESS | 2018年 / 6卷
基金
中国国家自然科学基金;
关键词
Cycle structure; adjacency graph; cyclotomy number; De Bruijn cycle; SHIFT-REGISTER;
D O I
10.1109/ACCESS.2018.2854265
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Feedback shift registers can be applied to the fields of communications, stream ciphers, computers, and design theory. The linear feedback shift registers are often used in the construction of De Bruijn sequences. For any given linear shift register, its cycle structure and adjacency graphs are features that must be investigated in the construction of the De Bruijn sequences by using the cycle-joining method. A class of linear feedback shift registers is discussed in this paper. The cycle structure of some linear feedback shift registers is derived. And the adjacency graphs are divided into two categories to analyze their structure in detail. Based on this kind of linear feedback shift registers combined with the cycle-joining method, a novel family of De Bruijn cycles is obtained. The number of the corresponding De Bruijn cycles produced is also proposed exactly.
引用
收藏
页码:38770 / 38779
页数:10
相关论文
共 24 条
  • [1] The Adjacency Graphs of a Class of LFSRs and Their Applications
    WANG Hui
    FENG Xiutao
    [J]. Chinese Journal of Electronics, 2019, 28 (06) : 1210 - 1216
  • [2] The Adjacency Graphs of a Class of LFSRs and Their Applications*
    Wang, Hui
    Feng, Xiutao
    [J]. CHINESE JOURNAL OF ELECTRONICS, 2019, 28 (06) : 1210 - 1216
  • [3] De Bruijn Sequences, Adjacency Graphs, and Cyclotomy
    Li, Ming
    Lin, Dongdai
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2018, 64 (04) : 2941 - 2952
  • [4] On the diameter of a class of the generalized de Bruijn graphs
    Caro, JDL
    Zeratsion, TW
    [J]. I-SPAN'02: INTERNATIONAL SYMPOSIUM ON PARALLEL ARCHITECTURES, ALGORITHMS AND NETWORKS, PROCEEDINGS, 2002, : 225 - 230
  • [5] On the Sound Covering Cycle Problem in Paired de Bruijn Graphs
    Komusiewicz, Christian
    Radulescu, Andreea
    [J]. FRONTIERS IN ALGORITHMICS (FAW 2015), 2015, 9130 : 150 - 161
  • [6] A New property Of binary undirected de bruijn graphs
    Junming X.
    Changhong L.
    Kemin Z.
    [J]. Chinese Annals of Mathematics, 2000, 21 (1) : 39 - 42
  • [7] A NEW PROPERTY OF BINARY UNDIRECTED de BRUIJN GRAPHS
    XU JUNMING
    LU CHANGHONG
    ZHANG KEMIN
    [J]. Chinese Annals of Mathematics,Series B, 2000, (01) : 39 - 42
  • [8] A new property of binary undirected de Bruijn graphs
    Xu, JM
    Lu, CH
    Zhang, KM
    [J]. CHINESE ANNALS OF MATHEMATICS SERIES B, 2000, 21 (01) : 39 - 42
  • [9] Partitioning de Bruijn graphs into fixed-length cycles for robot identification and tracking
    Grubman, Tony
    Sekercioglu, Y. Ahmet
    Wood, David R.
    [J]. DISCRETE APPLIED MATHEMATICS, 2016, 213 : 101 - 113
  • [10] ASYMPTOTICALLY-TIGHT BOUNDS ON THE NUMBER OF CYCLES IN GENERALIZED DE BRUIJN-GOOD GRAPHS
    MAURER, UM
    [J]. DISCRETE APPLIED MATHEMATICS, 1992, 37-8 : 421 - 436