Universal algorithm for synthesizing self-checking testers for constant- weight codes (Q1080840)

The design of self-checking checkers is considered. The checkers consist of two levels. The first level transforms the words of an m-out-of-n code into words of an L-out-of-q-code, and the other transforms the words of an l-out-of-q-code into words of l-out-of-2-code. The method for designing the first level of a transformer is proposed. The values L and t approximate the optimal values (L is the number of inputs, t is the number of m-out-of-n-code words, the appearance of which on the inputs of the checker provides the detection of all single errors in its structure). The method is based on a presentation of Boolean functions describing the first level of a transformer as a disjunction of functions with a number of arguments fewer than the initial one. The parameters L, t, r (r is the number of circuit levels) of a transformer are studied. It is demonstrated that, for a number of values of n and m, the parameters L, t, r are better than the values of similar parameters L', t', r' of the transformer which were designed by a method of \textit{M. A. Marouf} and \textit{A. D. Friedman} [IEEE Trans. Comput. C-27, 482-490 (1978; Zbl 0387.94036)].