1 |
J. von Neumann, Collected Works. Oxford, UK: Pergamon Press, 1962.
|
2 |
C. E. Shannon, "A mathematical theory of communication," The Bell System Technical Journal, vol. 27, pp. 623-656, 1948.
DOI
|
3 |
C. Stroud, Linear Feedback Shift Registers (LFSRs). Auburn, AL: Department of Electrical and Computer Engineering, Auburn University, 2004.
|
4 |
I. J. Good, "Normal recurring decimals," Journal of the London Mathematical Society, vol. s1-21, no. 3, pp. 167-169, 1946.
|
5 |
N. G. de Bruijn, "A combinatorial problem," in Proceedings of the Section of Sciences of the Koninklijke Nederlandse Akademie van Wetenschappen, Amsterdam, 1946, pp. 758-764.
|
6 |
J. H. Case and P. S. Fisher, "Long-term memory modules," Bulletin of Mathematical Biology, vol. 46, no. 2, pp. 295-326, 1984.
DOI
|
7 |
W. T. Tutte, Graph Theory. Cambridge, UK: Cambridge University Press, 2001.
|
8 |
J. H. van Lint, Combinatorial Theory Seminar, Eidhoven University of Technology. Berlin, Germany: Springer, 1974.
|
9 |
A. Alhakim and M. Akinwande, "A recursive construction of nonbinary de Bruijn sequences," Designs, Codes and Cryptography, vol. 60, no. 2, pp. 155-169, 2011.
DOI
|
10 |
F. M. Malyshev and V. E. Tarakanov, "Generalized de Bruijn graphs," Mathematical Notes, vol. 62, no. 4, pp. 449-456, 1997.
DOI
|
11 |
S. W. Golomb, Shift Register Sequences. Laguna Hills, CA: Aegean Park Press, 1982.
|
12 |
M. Li and P. Vitanyi, An Introduction to Kolmogorov Complexity and Its Applications. New York, NY: Springer, 2008.
|
13 |
R. G. Busacker and T. L. Saaty, Finite Graphs and Networks: An Introduction with Applications. New York, NY: McGraw-Hill, 1965.
|