科研之友
微信
新浪微博
Facebook
分享链接
摘要
This paper presents a combinatorial method to construct a de Bruijn sequence for any order n. The method is similar to that of the well-known prefer-one algorithm. The resulting sequences are compared and both methods are shown to be special cases of a unifying graph construction that is capable of generating all de Bruijn sequences.
