Fault detection tests for stuck-at faults on parity counter inputs
From MaRDI portal
Publication:895069
DOI10.1007/s10598-015-9282-1zbMath1343.94107OpenAlexW410945942MaRDI QIDQ895069
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
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Cites Work
- Self-testing/correcting with applications to numerical problems
- Easily tested circuits for linear functions
- Improved non-approximability results
- Breaking the $\epsilon$-Soundness Bound of the Linearity Test over GF(2)
- Linearity testing in characteristic two
- Robust Characterizations of Polynomials with Applications to Program Testing
- Efficient probabilistically checkable proofs and applications to approximations
- Unnamed Item
- Unnamed Item
This page was built for publication: Fault detection tests for stuck-at faults on parity counter inputs