首页|The Adjacency Graphs of a Class of LFSRs and Their Applications

The Adjacency Graphs of a Class of LFSRs and Their Applications

扫码查看
原文链接
  • NETL
  • NSTL
  • 万方数据
  • 维普
Nonlinear feedback shift registers (NFSRs) are widely used in communication and cryptography.How to construct more NFSRs with maximal periods,which can generate sequences with maximal periods,i.e.,de Brujin sequences,is an attractive problem.Recently many results on constructing de Bruijn sequences from adjacency graphs of Linear feedback shift registers (LFSRs) by means of the cycle joining method have been obtained.In this paper we discuss a class of LFSRs with characteristic polynomial p2(x),where p(x) is a primitive polynomial of degree n ≥ 2 over the finite field F2.As results,we determine their cycle structures and adjacency graphs,and further construct a class of new de Bruijn sequences from these LFSRs.

Nonlinear feedback shift register (NFSR)de Bruijn sequenceCycle structureAdjacency graph

WANG Hui、FENG Xiutao

展开 >

Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing 100190, China

Science and Technology on Communication Security Laboratory, Chengdu 610041, China

This work is supported by the National Natural Science Foundation of ChinaThis work is supported by the National Natural Science Foundation of ChinaScience and Technology on Communication Security Laboratory

61572491No.116881016142103010701

2019

10.1049/cje.2019.08.004

中国电子杂志(英文版)

中国电子杂志(英文版)

CSTPCDCSCDSCIEI
ISSN：1022-4653
年,卷(期)：2019.28(6)
  • 24