An algorithm for constructing m-ary de Bruijn sequences

Journal of Algorithms - Tập 7 - Trang 331-340 - 1986
Tuvi Etzion1
1Department of Computer Science, Technion-Israel Institute of Technology, Haifa, Israel

Tài liệu tham khảo

Etzion, 1984, Algorithms for the generation of full-length shift-register sequences, IEEE Trans. Inform. Theory IT-30, 480, 10.1109/TIT.1984.1056919 Flye-Sainte Marie, 1894, Solution to problem number 58, Interme. Mathe., 1, 107 Fredricksen, 1982, A survey of full length nonlinear shift register cycle algorithms, SIAM Rev., 24, 195, 10.1137/1024041 Fredricksen, 1978, Necklaces of beads in k colors and k-ary de Bruijn sequences, Discrete Math., 23, 207, 10.1016/0012-365X(78)90002-X Fredricksen, 1977, Lexicographic compositions and de Bruijn sequences, J. Combin. Theory, 22, 17, 10.1016/0097-3165(77)90059-0 Ralston, 1981, A new memoryless algorithm for de Bruijn sequences, J. Algorithms, 2, 50, 10.1016/0196-6774(81)90007-9