## An algorithm of the synthesis of minimal $$\Pi$$-schemes without zero chains realizing characteristic functions of linear codes.(Russian)Zbl 0676.94012

S. V. Yablonskiĭ [Doklady Akad. Nauk SSSR, n. Ser. 94, 805–806 (1954; Zbl 0056.01302)] has proved that a bound due to J. Riordoda for the number of contacts required for the series-parallel realization of linear Boolean functions is established. This paper introduces an algorithm of the synthesis of minimal series-parallel schemes (in short $$\Pi$$-schemes) without zero chains realizing characteristic functions of linear codes which consists of more steps than $$\exp(c\cdot n)$$ $$(c$$ is some constant).
Reviewer: P.Lakatos

### MSC:

 94B05 Linear codes (general theory) 94C10 Switching theory, application of Boolean algebra; Boolean functions (MSC2010)

Zbl 0056.01302
Full Text: