With Regard To The Nature Of The M Sequences

M sequence is a kind of pseudorandom code. It plays an important role in the cryptography due to its effective pseudorandom. The state-graph of M sequence of order n is a directed Hamilton cycle of de Bruijn-Good graph of order n. M sequence has several constructive methods such as cut-joining, spanning tree , the selected method , the induced method and so on. The number of the intersection points which some conjugate states of M sequence are in the state-graph of M sequence has closely relation to the cut-joining method of M sequence . In this paper, it shows an estimation of the number of the intersection points.