Easily testable circuits in Zhegalkin basis in the case of constant faults of type ``1'' at gate outputs
Diskretnaya Matematika, Tome 31 (2019) no. 2, pp. 14-19
Voir la notice de l'article provenant de la source Math-Net.Ru
We consider Boolean circuits in Zhegalkin basis and describe all Boolean functions that can be implemented by a circuit admitting a complete fault detection test of length $1$ in case of constant faults of type “1” at gate outputs.
Keywords:
Boolean circuits, constant faults, fault detection tests, Zhegalkin basis.
@article{DM_2019_31_2_a1,
author = {Yu. V. Borodina},
title = {Easily testable circuits in {Zhegalkin} basis in the case of constant faults of type ``1'' at gate outputs},
journal = {Diskretnaya Matematika},
pages = {14--19},
publisher = {mathdoc},
volume = {31},
number = {2},
year = {2019},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/DM_2019_31_2_a1/}
}
TY - JOUR AU - Yu. V. Borodina TI - Easily testable circuits in Zhegalkin basis in the case of constant faults of type ``1'' at gate outputs JO - Diskretnaya Matematika PY - 2019 SP - 14 EP - 19 VL - 31 IS - 2 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/DM_2019_31_2_a1/ LA - ru ID - DM_2019_31_2_a1 ER -
Yu. V. Borodina. Easily testable circuits in Zhegalkin basis in the case of constant faults of type ``1'' at gate outputs. Diskretnaya Matematika, Tome 31 (2019) no. 2, pp. 14-19. http://geodesic.mathdoc.fr/item/DM_2019_31_2_a1/