Efficient totally self-checking checkers for a class of Borden codes

DOI10.1109/12.475127MaRDI QIDQ4421151zbMATH OpenOpenAlexFDO

Authors Themistoklis Haniotakis, Antonis Paschalis, Dimitris Nikolos

Publication date 10 November 2003

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/12.475127

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15)

Recommendations

• Design of self-testing checkers for Borden codes
• Totally Self-Checking Checkers for Low-Cost Arithmetic Codes
• Design of maximum-speed self-checking m-out-of-n checkers
• Techniques for efficiently implementing totally self-checking checkers in MOS technology
• On TSC checkers for m-out-of-n codes

Cited in

(11)

• Techniques for efficiently implementing totally self-checking checkers in MOS technology
• Design of self-checking checkers for 1-out-of-3 codes
• PLA Implementation of k-out-of-n Code TSC Checker
• A Theory of Totally Self-Checking System Design
• Totally Self-Checking Checkers for Low-Cost Arithmetic Codes
• Partially strongly fault secure and partially strongly code disjoint 1-out-of-3 code checker
• Design of self-testing checkers for Borden codes
• On TSC checkers for m-out-of-n codes
• scientific article; zbMATH DE number 1498793 (Why is no real title available?)
• Low-cost modular totally self-checking checker design for m-out-of-n code
• Design of maximum-speed self-checking m-out-of-n checkers

This page was built for publication: Efficient totally self-checking checkers for a class of Borden codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4421151)