Theory 62(1), 610–624 (2016)Ĭhang, Z., Ezerman, M.F., Ling, S., Wang, H.: On binary de Bruijn sequences from LFSRs with arbitrary characteristic polynomials. Li, C., Zeng, X., Li, C., Helleseth, T., Li, M.: Construction of de Bruijn sequences from LFSRs with reducible characteristic polynomials. Huang, Y.: A new algorithm for the generation of binary de Bruijn sequences. A 19(2), 192–199 (1975)Įtzion, T., Lempel, A.: Algorithms for the generation of full-length shift-register sequences. 72, 1–11 (2018)įredricksen, H.: A class of nonlinear de Bruijn cycles. 340(3), 524–531 (2017)ĭragon, P.B., Hernandez, O.I., Sawada, J., Williams, A., Wong, D.: Constructing de Bruijn sequences with co-lexicographic order: the \(k\)-ary grandmama sequence. Sawada, J., Williams, A., Wong, D.: A simple shift rule for k-ary de Bruijn sequences. Sawada, J., Williams, A., Wong, D.: A surprisingly simple de Bruijn sequence construction. Sawada, J., Williams, A., Wong, D.: Generalizing the classic greedy and necklace constructions of de Bruijn sequences and universal cycles. Ralston, A.: De Bruijn sequences-a model example of the interaction of discrete mathematics and computer science. 23(3), 207–210 (1978)įredricksen, H.: A survey of full length nonlinear shift register cycle algorithms. World Scientific, Singapore (2017)įredricksen, H., Maiorana, J.: Necklaces of beads in k colors and k-ary de bruijn sequences. Golomb, S.W.: Shift Register Sequences, 3rd edn. De Bruijn, N.G.: A combinatorial problem.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |