2
Views
0
CrossRef citations to date
0
Altmetric
Original Articles

An Algorithm for Finding the Minimal Reed-Müller Canonic Expansion of Switching Functions

& (Fellow)
Pages 462-466 | Received 02 Jun 1981, Published online: 10 Jul 2015

REFERENCES

  • Peterson (W W). Error Correcting Codes. 1961. Wiley and Cambridge, Mass., MIT Press, New York.
  • Reddy (S M). Easily-Testable Realizations for Logic Functions IEEE Trans. C-21, 11; 1972; 1183–1188.
  • Marincovic (S B) & Tosic (Z). Algorithm for Minimal Polarized Polynomial Form Determination. IEEE Trans. C-23, 12; 1974; 1313–1315.
  • Mukhopadhyay (A) & Schmitz (G). Minimization of Exclusive OR and Logical Equivalence Switching Circuits. IEEE Trans. C-19, 2; 1970; 140–142.
  • Saluja (K K) & Ong (E H). Minimization of Reed-Muller Canonic Expansion. IEEE Trans. C-28, 7; 1979; 535–537.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.