Design of totally self-checking combinational networks using m-out-of-n codes

zbMath0456.94029MaRDI QIDQ1150576

E. S. Sogomonyan, E. V. Slabakov

Publication date: 1980

Published in: Automation and Remote Control (Search for Journal in Brave)

zbMATH Keywords

graph coloring

Mathematics Subject Classification ID

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

Related Items (1)

Conditions for detecting a logical element fault in a combination device under concurrent checking based on Berger's code

This page was built for publication: Design of totally self-checking combinational networks using m-out-of-n codes