De Bruijn Graph Homomorphisms and Recursive De Bruijn Sequences

Details De Bruijn Graph Homomorphisms and Recursive De Bruijn Sequences De Bruijn Graph Homomorphisms and Recursive De Bruijn Sequences

2008-12-21

arxiv.org/abs/0812.4012v1

Mathematics

Combinatorics

15 pages, 1 figure, 2 tables, submitted

Scientific paper

This paper presents a method to find new De Bruijn cycles based on ones of lesser order. This is done by mapping a De Bruijn cycle to several vertex disjoint cycles in a De Bruijn digraph of higher order and connecting these cycles into one full cycle. We characterize homomorphisms between De Bruijn digraphs of different orders that allow this construction. These maps generalize the well-known D-morphism of Lempel between De Bruijn digraphs of consecutive orders. Also, an efficient recursive algorithm that yields an exponential number of nonbinary De Bruijn cycles is implemented.

Affiliated with

Also associated with

No associations

Rating

De Bruijn Graph Homomorphisms and Recursive De Bruijn Sequences does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with De Bruijn Graph Homomorphisms and Recursive De Bruijn Sequences, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and De Bruijn Graph Homomorphisms and Recursive De Bruijn Sequences will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-593016