On the number of minimal tests checking the block circuits of parity functions for closings

DOI10.1515/DMA.1997.7.6.573zbMath0982.94039OpenAlexW2062842480MaRDI QIDQ4522715

Dmitry S. Romanov

Publication date: 4 January 2001

Published in: Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/dma.1997.7.6.573

zbMATH Keywords

limit distributiondeadlock testsrandom minimal coveringblock circuits of parity functions

Mathematics Subject Classification ID

Factorials, binomial coefficients, combinatorial functions (05A10) Fault detection; testing in circuits and networks (94C12)

This page was built for publication: On the number of minimal tests checking the block circuits of parity functions for closings