Some VLSI decompositions of the de Bruijn graph

DOI10.1016/0012-365X(92)90546-RzbMath0755.94016MaRDI QIDQ1199602

Sam Dolinar, Tsz-Mei Ko, Robert J. McEliece

Publication date: 16 January 1993

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

directed graphconvolutional codede Bruijn graphsbuilding blocksJPL designViterbi decoderVLSI decomposition

Mathematics Subject Classification ID

Applications of graph theory to circuits and networks (94C15)

Related Items (4)

Perfect factors in the de Bruijn graph ⋮ New classes of perfect maps. I ⋮ Characterising the linear complexity of span 1 de Bruijn sequences over finite fields. ⋮ Graphs with the unique path property: Structure, cycles, factors, and constructions

Cites Work

• A VLSI decomposition of the deBruijn graph

This page was built for publication: Some VLSI decompositions of the de Bruijn graph