Design of self-testing checkers for Borden codes

DOI10.1109/12.494103MaRDI QIDQ4420946zbMATH OpenOpenAlexFDO

Authors Stanisław J. Piestrak

Publication date 1996

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

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

zbMATH Keywords

unidirectional error detecting code

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35) Fault detection; testing in circuits and networks (94C12)

Recommendations

• Efficient totally self-checking checkers for a class of Borden codes
• Design of Fast Self-Testing Checkers for a Class of Berger Codes
• Design method of a class of embedded combinational self-testing checkers for two-rail codes
• Design of self-checking checkers for 1-out-of-3 codes
• Design methods of single-output built-in self-checking circuits for equilibrium codes
• Design of high-speed checkers for Berger codes
• Totally Self-Checking Checkers for Low-Cost Arithmetic Codes
• Using Reed-Muller codes in self-testing circuits
• Universal algorithm for synthesizing self-checking testers for constant- weight codes

Cited in

(4)

• scientific article; zbMATH DE number 4123679 (Why is no real title available?)
• Efficient totally self-checking checkers for a class of Borden codes
• Design of Fast Self-Testing Checkers for a Class of Berger Codes
• Using Reed-Muller codes in self-testing circuits

This page was built for publication: Design of self-testing checkers for Borden codes

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