Reliable computation by networks in the presence of noise

DOI10.1109/18.30978MaRDI QIDQ3832476zbMATH OpenOpenAlexFDO

Authors Tomás Feder

Publication date 1989

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/18.30978

zbMATH Keywords

reliabilityrandomly occurring failureserror-tolerant formulaserror-tolerant networkslower bounds on the depth of Boolean networks

Mathematics Subject Classification ID

Recommendations

• Reliable computation by formulas in the presence of noise
• On the maximum tolerable noise for reliable computation by formulas
• On the maximum tolerable noise for reliable computation by formulas
• Can large fanin circuits perform reliable computations in the presence of faults?
• scientific article; zbMATH DE number 4091415

Cited in

(10)

• scientific article; zbMATH DE number 4110630 (Why is no real title available?)
• Computing in fault tolerant broadcast networks and noisy decision trees
• Invariance of complexity measures for networks with unreliable gates
• Fault tolerance in cellular automata at high fault rates
• Lower bounds for the complexity of reliable Boolean circuits with noisy gates
• Signal propagation and noisy circuits
• Reliable computation by formulas in the presence of noise
• Locating errors in faulty formulas
• scientific article; zbMATH DE number 4091415 (Why is no real title available?)
• On the maximum tolerable noise for reliable computation by formulas

This page was built for publication: Reliable computation by networks in the presence of noise

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