The 2's Complement and Other Semi-Systematic Binary Codes

DOI10.1109/PGEC.1966.264383MaRDI QIDQ5519581zbMATH OpenOpenAlexFDO

Authors Angelo Raffaele Meo

Publication date 1966

Published in IEEE Transactions on Electronic Computers (Search for Journal in Brave)

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

zbMATH Keywords

circuitsnetworks

Mathematics Subject Classification ID

Analytic circuit theory (94C05)

Recommendations

• On the synthesis of NAND or NOR networks having multi-level
• scientific article; zbMATH DE number 3599961
• scientific article; zbMATH DE number 3865163
• Realization of Logical Functions by a Network of Threshold Components with Specified Sensitivity
• When do extra majority gates help? Polylog\((N)\) majority gates are equivalent to one

Cited in

(10)

• Pairs of majority-decomposing functions
• Algebraic methods for synthesizing majority gate networks
• On the synthesis of NAND or NOR networks having multi-level
• scientific article; zbMATH DE number 3865163 (Why is no real title available?)
• MAJORITY-VOTE ON DIRECTED BARABÁSI–ALBERT NETWORKS
• scientific article; zbMATH DE number 3599961 (Why is no real title available?)
• scientific article; zbMATH DE number 1129499 (Why is no real title available?)
• scientific article; zbMATH DE number 3893098 (Why is no real title available?)
• An Extension of the Method of Cohn and Lindaman
• Synthesis of Majority Expressions Through Primitive Function Manipulation

This page was built for publication: The 2's Complement and Other Semi-Systematic Binary Codes

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