An efficient implementation algorithm for generating de Bruijn sequences

Computer Standards & Interfaces - Tập 31 - Trang 1190-1191 - 2009
Weiguo Zhang1, Shuanggen Liu2, Huawei Huang3
1State Key Laboratory of Integrated Service Networks, Xidian University, Xi’an 710071, China
2College of Computer Information Engineering, Jiangxi Normal University, Nanchang 330022, China
3College of Information, South China Agricultural University, Guangzhou 510642, China

Tài liệu tham khảo

De Bruijn, 1946, A combinatorial problem, Koninklije Nedderlandse Academie van Wetenshappen, 49, 758 Martin, 1934, A problem in arrangement, Bulletin of the American Mathematics Society, 40, 859-846, 10.1090/S0002-9904-1934-05988-3 Ralsto, 1982, De Bruijn sequences — a model example of the interaction of discrete mathematics and computer sciences, Mathematics Magazine, 55, 131, 10.2307/2690079 Fredrickson, 1982, A survey of full length nonlinear shift register cycle algorithms, SIAM Review, 24, 195, 10.1137/1024041 Golomb, 1967