Improved bounds for algorithm-based fault tolerance
Daniel J. Rosenkrantz, Srivaths Ravi · IEEE Transactions on Computers · 1993
Lower and upper bounds are established for the combinatorial problem of constructing minimal test sets for error detection in multiprocessor systems. The construction for detecting two errors produces minimal test sets, while that for three errors produces test sets whose size exceeds the lower bound by at most one. Also presented is a divide-and-conquer construction scheme for four or more errors.>