Abstract
We establish new properties of modular summation codes that allow for an efficient use of these codes to organize concurrent error detection (CED) systems for combinational logical circuits with unidirectionally independent outputs. We compare the properties of modular summation codes and classical Berger codes. We obtain conditions for the construction of combinational logical circuits with detection of all single faults based on modular summation codes.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
