摘要： 提出一种生成de Bruijn序列的消元算法，通过一个m+1元n级de Bruijn序列找出其Look-up表和Look-up表标签，基于该Look-up表标签进行修正，找出m元n级的Look-up表和Look-up表标签，并由其产生m元n级de Bruijn序列。该算法在已知一个de Bruijn序列的情况下有效。
关键词:
de Bruijn序列,
Look-up表,
Look-up表标签,
消元,
节点链
Abstract: Algorithm by removing an element is presented in this paper, which is to calculate m-ary de Bruijn sequences by removing element of m+1-ary de Bruijn sequence. The implementing method is by means of finding the Look-up table labels of m+1-ary n stage de Bruijn sequences from m+1-ary n stage de Bruijn sequences and finding m-ary n stage Look-up table labels by ameliorating the m+1-ary n stage Look-up table labels, then generating m-ary n stage de Bruijn sequences by using the relative Look-up table. The algorithm is effective while a de Bruijn sequence is given.
Key words:
de Bruijn sequence,
Look-up table,
Look-up table label,
removing an element,
node chain
中图分类号:
谢深泉. 生成de Bruijn序列的消元算法[J]. 计算机工程, 2009, 35(5): 59-60,8.
XIE Shen-quan. Algorithm for Generating de Bruijn Sequence by Removing an Element[J]. Computer Engineering, 2009, 35(5): 59-60,8.