Decomposition of de bruijn graphs

References

• Bhattacharya , B. , Ghose , S. , Sinha , B. P. and Srimani , P. K. 1984 . “ Heuristic search approach to optimal routing in a distributed architecture ” . In Lecture notes in Computer Science , Vol. 181 , 152 – 164 . Springer Verlag .
   Google Scholar
• Bryant , P. R. and Christensen , J. The enumeration of shift register sequences . J. Comb. Th. , 35 154 – 172 .
   Google Scholar
• Cummings , L. 1985 . Synchronizable codes in the de Bruijn graph . Ars Combinatoria , 19 : 73 – 80 .
   Google Scholar
• Lang , S. 1971 . Algebra , Addison-Wesley .
   Google Scholar
• Piret Ph. Algebraic Properties of Convolutional Codes MBLE Research Lab Brussels 1976 Tech. Rpt. R339
   Google Scholar
• Ronse , C. 1984 . “ Feedback shift registers ” . In Lecture notes in Computer Science , Vol. 169 , Springer Verlag .
   Google Scholar
• Samatham , M. R. and Pradhan , D. K. 1989 . The de Bruijn multiprocessor network. A versatile parallel processing and sorting network for VLSI . IEEE Trans. on Computers , 38 : 567 – 581 .
   Web of Science ®Google Scholar
• Schlumberger M. L. de Bruijn Communication Networks Computer Sci. Dept., Stanford University 1974 Ph.D. dissertation
   Google Scholar