Fault detection tests for stuck-at faults on parity counter inputs

DOI10.1007/S10598-015-9282-1MaRDI QIDQ895069zbMATH OpenOpenAlexFDO

Authors Dmitry S. Romanov

Publication date 26 November 2015

Published in Computational Mathematics and Modeling (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10598-015-9282-1

zbMATH Keywords

Boolean functiontest for circuit inputslinear Boolean functionparity counter

Mathematics Subject Classification ID

Fault detection; testing in circuits and networks (94C12)

Cites work

• scientific article; zbMATH DE number 3150822 (Why is no real title available?)
• scientific article; zbMATH DE number 3344519 (Why is no real title available?)
• Breaking the \(\epsilon\)-soundness bound of the linearity test over GF(2)
• Easily tested circuits for linear functions
• Efficient probabilistically checkable proofs and applications to approximations
• Improved non-approximability results
• Linearity testing in characteristic two
• Robust Characterizations of Polynomials with Applications to Program Testing
• Self-testing/correcting with applications to numerical problems

Cited in

(1)

• Stuck-At Fault Tests in the Presence of Undetectable Bridging Faults

This page was built for publication: Fault detection tests for stuck-at faults on parity counter inputs

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