This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Note on Self-Checking Checkers
October 1974 (vol. 23 no. 10)
pp. 1100-1102
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.
Index Terms:
m-out-of-n codes, totally self-checking checkers.
Citation:
S.M. Reddy, "Note on Self-Checking Checkers," IEEE Transactions on Computers, vol. 23, no. 10, pp. 1100-1102, Oct. 1974, doi:10.1109/T-C.1974.223811
Usage of this product signifies your acceptance of the Terms of Use.