A Class of FSRs and Their Adjacency Graphs.
Ming Li, Dongdai Lin · 2014
In this paper, We find a way to construct FSRs. The constructed FSRs can be depicted in many ways. They are just the FSRs whose characteristic polynomial can be written as g = (x0 +x1)∗f for some f. Their adjacency graphs do not contain self-loops. Further more, we can divide the vertexes in their adjacency graphs into two sets such that the edges are all between the two sets. The number of this class of FSRs is also considered. Besides, some applications in LFSRs and constructing full cycles are presented. 1