Sign in
Note on Self-Checking Checkers
Journal article   Peer reviewed

Note on Self-Checking Checkers

S.M Reddy
IEEE transactions on computers, Vol.C-23(10), pp.1100-1102
10/1974
DOI: 10.1109/T-C.1974.223811

View Online

Abstract

Totally self-checking checkers for k-out-of-(2k + 1), (k + 1)-out-of-(2k + 1), and k-out-of-2k codes are given. The new checkers for the k-out-of-2k codes require only 2k tests to detect all stuck-at faults.
m-out-of-n codes totally self-checking checkers

Details

Metrics