On implementation of some systems of elementary conjunctions in the class of separating contact circuits
-
Elena G. Krasulina
Abstract
We show that the system of elementary conjunctions
Note
Originally published in Diskretnaya Matematika (2021) 33, №4, 47–60 (in Russian).
Acknowledgment
The author is deeply grateful to O. M. Kasim-Zade for constant attention to this work.
References
[1] Shannon C.E., “A symbolic analysis of relay and switching circuits”, Trans. AIEE, 57 (1938), 713–722.10.1109/EE.1938.6431064Search in Google Scholar
[2] Shannon C.E., “The synthesis of two-terminal series parallel networks”, Bell Syst. Techn. J., 28:1 (1949), 59–98.10.1002/j.1538-7305.1949.tb03624.xSearch in Google Scholar
[3] Moore E.F., “Minimal complete relay decoding networks”, IBM J. Res. Dev., 4:5 (1960), 525–531.10.1147/rd.45.0525Search in Google Scholar
[4] König D., Theorie der endlichen and unendlichen Graphen, New York: Chelsea Publ. Company, 1950.Search in Google Scholar
[5] Lupanov O.B., “The synthesis of contact circuits”, Dokl. Akad. Nauk SSSR, 119:1 (1958), 23–26 (in Russian).Search in Google Scholar
[6] Lupanov O.B., “Über die Synthese einiger Klassen von Steuersystemen”, Probleme der Kybernetik, 7 (1966), 20–63.Search in Google Scholar
[7] Lupanov O.B., “On realizing symmetric functions in Boolean algebra by contact networks”, Nauka,Moscow, Problemy Kiber-netiki, 1965,№15, 85–99 (in Russian).Search in Google Scholar
[8] Lupanov O.B., Asymptotic bounds on complexity of control systems, Moscow University Press, Moscow, 1984 (in Russian).Search in Google Scholar
[9] E.I. Nechiporuk, “On topological principles of self-correction”, Nauka, Moscow, Problemy Kibernetiki, 1969, №21, 5–102 (in Russian).Search in Google Scholar
[10] Red’kin N.P., “Realization of systems of conjunctions by contact networks”, Problemy Kibernetiki, 30 (1975), 263–276 (in Russian).Search in Google Scholar
[11] Andreev A.E., “A universal principle of self-correction”, Math. USSR-Sb., 55:1 (1986), 145–169.10.1070/SM1986v055n01ABEH002997Search in Google Scholar
[12] Vikhlyantsev I.A., “Realization of systems of conjunctions by means of switching circuits”, Diskretnaya Matematika, 1:4 (1989), 3–11 (in Russian).Search in Google Scholar
[13] Krasulina E.G., “On a lower bound of elementary symmetric functions system implementation by switching circuits”, Moscow, Fizmatgiz, Mathematical Problems of Cybernetics, 2019,№19, 113–122 (in Russian).Search in Google Scholar
[14] Peterson W.W., Weldon E.J., Error-correcting codes, MIT Press, 1972.Search in Google Scholar
© 2023 Walter de Gruyter GmbH, Berlin/Boston
Articles in the same Issue
- Frontmatter
- Some classes of easily testable circuits in the Zhegalkin basis
- On the concentration of the independence numbers of random hypergraphs
- On implementation of some systems of elementary conjunctions in the class of separating contact circuits
- Local limit theorem for the number of empty cells in a scheme of random equiprobable allocations
- Maximally nonlinear functions over finite fields
- The limit joint distributions of statistics of four tests of the NIST package
Articles in the same Issue
- Frontmatter
- Some classes of easily testable circuits in the Zhegalkin basis
- On the concentration of the independence numbers of random hypergraphs
- On implementation of some systems of elementary conjunctions in the class of separating contact circuits
- Local limit theorem for the number of empty cells in a scheme of random equiprobable allocations
- Maximally nonlinear functions over finite fields
- The limit joint distributions of statistics of four tests of the NIST package
