TWO ALGORITHMS FOR M-SEQUENCES

【摘要】 <正> This paper presents two algorithms for shift register M-sequences. The first follows the reasoning by mathematical induction, and turns into the tabular form instead of graphical ones. The essentials are tabulation, simplification and being axiomatized. The second follows the method of "cut-join" by an arithmetical means instead of graphical one, which is available for a computer. Two remarks seem useful for programming. In the third part some comparisons and statements of the algorithms are given.更多还原