scientific article; zbMATH DE number 4176986

MaRDI QIDQ3200995zbMATH OpenFDO

Authors N. I. Turdaliev

Publication date 1990

zbMATH Keywords

asymptotic complexityBoolean functionfunctional elementslinear functionselfcorrecting circuits

Mathematics Subject Classification ID

Fault detection; testing in circuits and networks (94C12)

Recommendations

• scientific article; zbMATH DE number 850403
• scientific article; zbMATH DE number 4187722
• scientific article; zbMATH DE number 1285549
• scientific article; zbMATH DE number 4176985
• Self-correcting schemes for functions of polynomial weight
• Complexity of self-correcting circuits for some sequence of Boolean functions
• scientific article; zbMATH DE number 942481
• On minimal circuits for linear functions over some bases
• About the reliability of circuits in the complete finite basis containing an essential linear function
• On circuits of functional elements of finite depth of branching

Cited in

(3)

• On self-correcting logic circuits of unreliable gates with at most two inputs
• On self-correcting logic circuits of unreliable gates
• Implementation of Linear Boolean Functions by Self-Correcting Circuits of Unreliable Logic Gates

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3200995)