Decompositions of de Bruijn networks

Abstract

This paper deals with problems of decomposition of de Bruijn graph into isomorphic building blocks based on cover sets. The aim is to find so called lowest-cost cover sets which provide decompositions into building blocks with minimal number of external edges. We present formulae for the costs of basic covers. We give new results on the lowest-cost cover set design. We also give new results on the topology of graphs of building blocks based on basic cover sets. We also discuss several open problems.