On binary de Bruijn sequences from LFSRs with arbitrary characteristic polynomials
We propose a construction of de Bruijn sequences by the cycle joining method from linear feedback shift registers (LFSRs) with arbitrary characteristic polynomial f(x). We study in detail the cycle structure of the set \(\varOmega (f(x))\) that contains all sequences produced by a specific LFSR on distinct inputs and provide a fast way to find a state of each cycle. This leads to an efficient algorithm to find all conjugate pairs between any two cycles, yielding the adjacency graph. The approach is practical to generate a large class of de Bruijn sequences up to order \(n \approx 20\). Many previously proposed constructions of de Bruijn sequences are shown to be special cases of our construction.
KeywordsBinary periodic sequence LFSR de Bruijn sequence Cycle structure Adjacency graph Cyclotomic number
Mathematics Subject Classification11B50 94A55 94A60
Adamas Aqsa Fahreza wrote the python implementation code. The work of Z. Chang is supported by the National Natural Science Foundation of China under Grant 61772476 and the Key Scientific Research Projects of Colleges and Universities in Henan Province under Grant 18A110029. Research Grants TL-9014101684-01 and MOE2013-T2-1-041 support the research carried out by M. F. Ezerman, S. Ling, and H. Wang. The authors gratefully acknowledge the advise and feedbacks from the editor and the reviewers. They led us to a better presentation of the results.
- 1.Broder A.: Generating random spanning trees. In: Proceedings of 30th Annual Symposium on Foundations of Computer Science, pp. 442–447 (1989).Google Scholar
- 3.Chang Z., Ezerman M.F., Ling S., Wang H.: The cycle structure of LFSR with arbitrary characteristic polynomial over finite fields. Cryptogr. Commun. (2017) (Online First 20 Dec 2017). https://doi.org/10.1007/s12095-017-0273-2.
- 8.Ezerman M.F., Fahreza A.A.: A binary de Bruijn sequence generator from product of irreducible polynomials. https://www.github.com/adamasstokhorst/debruijn.
- 16.Knuth D.E.: Grayspspan. http://www-cs-faculty.stanford.edu/~uno/programs/grayspspan.w.
- 17.Knuth D.E.: The Art of Computer Programming. Seminumerical Algorithms, vol. 2, 3rd edn. Addison-Wesley/Longman Publishing, Boston (1997).Google Scholar
- 18.Knuth D.E.: The Art of Computer Programming, vol. 4A, Combinatorial Algorithms. Part 1. Addison-Wesley, Upple Saddle River (2011).Google Scholar