MODULO WEIGHTED CODE WITH SUMMATION FOR TECHNICAL DIAGNOSTICS SYSTEMS
Authors describe the method of formation of the code with summation with minimum total number of undetectable errors for specific lengths of data and check vectors. This code belongs to the class of modulo weighted codes with summation. Comparison of this code with classic Berger code is given in the paper. Authors adduce the results of experiments with the system of test examples LGSynth`89 which is frequently used to test new ways of reliable discrete systems synthesis.
Keywords: concurrent error detection system; Berger code; modulo weight-based code with summation; optimal code; data bits; undetectable error; combinational circuits testing
