Implementation of Linear Boolean Functions by Self-Correcting Circuits of Unreliable Logic Gates
From MaRDI portal
Publication:6494792
DOI10.1134/S0001434624010073MaRDI QIDQ6494792FDOQ6494792
Publication date: 30 April 2024
Published in: Mathematical Notes (Search for Journal in Brave)
Theory of computing (68Qxx) Circuits, networks (94Cxx) Miscellaneous topics in information and communication theory (94Dxx)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Short single fault detection tests for logic networks under arbitrary faults of gates
- On the length of diagnostic tests for Boolean circuits
- On asymptotically minimal self-correcting schemes for a sequence of Boolean functions
- Title not available (Why is that?)
- On the synthesis of self-correcting schemes from functional elements with a small number of reliable elements
- Short complete diagnostic tests for circuits implementing linear Boolean functions
- Some classes of easily testable circuits in the Zhegalkin basis
- Easily testable circuits in Zhegalkin basis in the case of constant faults of type ``1 at gate outputs
- Self-correcting schemes for functions of polynomial weight
- Title not available (Why is that?)
- On self-correcting logic circuits of unreliable gates with at most two inputs
- Title not available (Why is that?)
- Single diagnostic tests for inversion faults of gates in circuits over arbitrary bases
- On self-correcting logic circuits of unreliable gates
- Title not available (Why is that?)
- Short complete diagnostic tests for circuits with two additional inputs in some basis
This page was built for publication: Implementation of Linear Boolean Functions by Self-Correcting Circuits of Unreliable Logic Gates
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6494792)
