Design of Fast Self-Testing Checkers for a Class of Berger Codes

DOI10.1109/TC.1987.1676949MaRDI QIDQ4721961zbMATH OpenOpenAlexFDO

Authors Staniław J. Piestrak

Publication date 1987

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

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

zbMATH Keywords

Berger codesconcurrent error detectionfault detectioninverter-free circuitsm-out-of-n codesoptimal separable codesself-checking circuitsself-testing checkersunidirectional errorsunordered codes

Mathematics Subject Classification ID

Recommendations

• Design of self-testing checkers for Borden codes
• Study of combinational self-checking devices with independent and monotonic independent outputs
• scientific article; zbMATH DE number 4123679
• Design of maximum-speed self-checking m-out-of-n checkers
• Burst Unidirectional Error-Detecting Codes

Cited in

(4)

• Universal algorithm for synthesizing self-checking testers for constant- weight codes
• scientific article; zbMATH DE number 4123679 (Why is no real title available?)
• Design of self-testing checkers for Borden codes
• Design of maximum-speed self-checking m-out-of-n checkers

This page was built for publication: Design of Fast Self-Testing Checkers for a Class of Berger Codes

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