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

DOI10.1007/S10598-015-9282-1zbMATH Open1343.94107OpenAlexW410945942MaRDI QIDQ895069FDOQ895069

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

• Self-testing/correcting with applications to numerical problems
• Linearity testing in characteristic two
• Robust Characterizations of Polynomials with Applications to Program Testing
• Title not available (Why is that?)
• Improved non-approximability results
• Efficient probabilistically checkable proofs and applications to approximations
• Easily tested circuits for linear functions
• Breaking the \(\epsilon\)-soundness bound of the linearity test over GF(2)
• Title not available (Why is that?)

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)