|
Problemy Peredachi Informatsii, 1982, Volume 18, Issue 3, Pages 62–73
(Mi ppi1237)
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper)
Automata Theory and Large System Science
Universal Synthesis Algorithm for $1/n$ Testers
V. V. Sapozhnikov, V. Rabara
Abstract:
The authors develop a method of synthesizing $1/n$ testers, these being control circuits that establish the fact that a binary vector belongs to a one-out-of-$n$ code. Some practical results of the use of the method are given.
Received: 10.09.1980
Citation:
V. V. Sapozhnikov, V. Rabara, “Universal Synthesis Algorithm for $1/n$ Testers”, Probl. Peredachi Inf., 18:3 (1982), 62–73; Problems Inform. Transmission, 18:3 (1982), 209–218
Linking options:
https://www.mathnet.ru/eng/ppi1237 https://www.mathnet.ru/eng/ppi/v18/i3/p62
|
|