Cycle Decomposition by Disjoint Transpositions
暂无分享,去创建一个
Abstract We investigate in this paper the cycle structures induced on cyclic permutations by disjoint transpositions or, equivalently, the decomposition of a statecycle by interchanging the successors of disjoint state pairs. In both cases we relate the number of resulting cycles to a binary matrix which in a simple manner describes the interaction of the modifications. A possible application to an outstanding problem in shift-register cycle structures is described.
[1] Abraham Lempel,et al. On extremal factors of the de Bruijn graph , 1971 .
[2] Michael Yoeli. Counting with Nonlinear Binary Feedback Shift Registers , 1963, IEEE Trans. Electron. Comput..
[3] Abraham Lempel,et al. On a Homomorphism of the de Bruijn Graph and its Applications to the Design of Feedback Shift Registers , 1970, IEEE Transactions on Computers.