Some classes of easily testable circuits in the Zhegalkin basis
Diskretnaya Matematika, Tome 33 (2021) no. 4, pp. 3-10
Voir la notice de l'article provenant de la source Math-Net.Ru
We identify the classes of Boolean functions that may be implemented by easily testable circuits in the Zhegalkin basis for constant type-1 faults on outputs of gates. An upper estimate for the length of a complete fault detection test for three-place functions is obtained.
Keywords:
circuit of gates, constant faults, fault detection test, Zhegalkin basis.
@article{DM_2021_33_4_a0,
author = {Yu. V. Borodina},
title = {Some classes of easily testable circuits in the {Zhegalkin} basis},
journal = {Diskretnaya Matematika},
pages = {3--10},
publisher = {mathdoc},
volume = {33},
number = {4},
year = {2021},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/DM_2021_33_4_a0/}
}
Yu. V. Borodina. Some classes of easily testable circuits in the Zhegalkin basis. Diskretnaya Matematika, Tome 33 (2021) no. 4, pp. 3-10. http://geodesic.mathdoc.fr/item/DM_2021_33_4_a0/