Issue No. 10 - October (1974 vol. 23)
S.M. Reddy , Department of Electrical Engineering, University of Iowa
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.
S. Reddy, "Note on Self-Checking Checkers," in IEEE Transactions on Computers, vol. 23, no. , pp. 1100-1102, 1974.