Abstract
It was proved that one can implement any non-constant Boolean function in n variables by an irredundant logic network in the basis {&, ⊕,¬}, allowing, when n ≥ 3, a single fault detection test with length not more than 6n - 10 relative to arbitrary faults of gates.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
