Abstract: This paper is actually a note and a proof about the results in paper (1). At present, most of the clock-controlled sequences discussed by researchers are interleaving structures of some m-sequences which are shift-equivalent. Paper(1)tries to give a pseudo-random interleaving structure of some m-sequences which are not shift-equivalent. We call the sequences generated by it multiplexed sequences controlled by a clock and investigate their minimum polynomials under some simple conditions. Thus the complexities and periods of this class of sequences are found.

Key words: multiplexed sequence controlled by a clock, minimum polynomial, linear shift register sequence, linear complexity