On self-correcting logic circuits of unreliable gates
From MaRDI portal
Publication:2241352
DOI10.1134/S1995080221110172zbMath1490.94083OpenAlexW3208063233MaRDI QIDQ2241352
Publication date: 9 November 2021
Published in: Lobachevskii Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s1995080221110172
Switching theory, applications of Boolean algebras to circuits and networks (94C11) Boolean functions (94D10)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the synthesis of self-correcting schemes from functional elements with a small number of reliable elements
- Self-correcting schemes for functions of polynomial weight
- On asymptotically minimal self-correcting schemes for a sequence of Boolean functions
- Short single tests for circuits with arbitrary stuck-at faults at outputs of gates
- Complexity of self-correcting circuits for some sequence of Boolean functions
- Complexity of realization of Boolean functions with small number of unit values by selfcorrecting contact circuits
- Correcting closures in contact circuits
- A UNIVERSAL PRINCIPLE OF SELF-CORRECTION
- The Two-Valued Iterative Systems of Mathematical Logic. (AM-5)
This page was built for publication: On self-correcting logic circuits of unreliable gates