De Bruijn Graph Homomorphisms and Recursive De Bruijn Sequences

Simple item page
dc.creatorAlhakim, Abbas
dc.creatorAkinwande, Mufutau
dc.date2008-12-21
dc.date.accessioned2026-07-07T12:21:08Z
dc.date.available2026-07-07T12:21:08Z
dc.descriptionThis 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.
dc.description15 pages, 1 figure, 2 tables, submitted
dc.identifierhttps://arxiv.org/abs/0812.4012
dc.identifierhttp://arxiv.org/abs/0812.4012
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/213273
dc.subjectCombinatorics
dc.subjectInformation Theory
dc.subject68R05, 68R10, 68R15
dc.titleDe Bruijn Graph Homomorphisms and Recursive De Bruijn Sequences
dc.typetext

Files

Collections

arXiv