Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference21 articles.
1. Spans of preference functions for de Bruijn sequences;Alhakim;Discrete Appl. Math.,2012
2. Lexicographically least circular substrings;Booth;Inf. Process. Lett.,1980
3. Circuits and trees in oriented linear graphs;de Bruijn;Bull. Belg. Math. Soc. Simon Stevin,1951
4. Factorizing words over an ordered alphabet;Duval;J. Algorithms,1983
5. Algorithms for the generation of full-length shift-register sequences;Etzion;IEEE Trans. Inform. Theory,1984
Cited by
16 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Scalable design of orthogonal DNA barcode libraries;Nature Computational Science;2024-06-07
2. Constructions of full cycles;Sequences and the de Bruijn Graph;2024
3. Statistical Span Property of Binary Run Sequences;IEEE Transactions on Information Theory;2023-04
4. Enumeration of Both-Ends-Fixed <i>k</i>-Ary Necklaces and Its Applications;IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences;2023-03-01
5. Entropy Lost: Nintendo’s Not-So-Random Sequence of 32, 767 Bits;FDG '22: Proceedings of the 17th International Conference on the Foundations of Digital Games;2022-09-05