{'fraction_non_alphanumeric': 0.014106583072100314, 'fraction_numerical': 0.0, 'mean_word_length': 5.023584905660377, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Boolean Complement Method to Polynomial Codes for Combinational Circuits Testing

The authors have proposed to use the Boolean complement method to polynomial codes for combinational circuits checking. The Boolean complement method is based all or part of the functions correction in the concurrent error-detection circuit to transform them into functions of a controllable type. In this case, to obtain code vectors of polynomial codes. Modulo two adders are used for conversion. They are required as many as there are check bits in the polynomial code. The authors proposed to single out groups of convertible and non-convertible outputs at the stage of organizing the concurrent error-detection circuit. In this case, the number of potentially undetectable errors in code vectors is more than halved. In addition, this makes it possible to take into account the features of error detection by polynomial codes in data vectors. It is proposed to check combinational circuits by the Boolean complement method with the allocation of output groups, in which the occurrence of errors of a given multiplicity is impossible. The corresponding polynomial codes check these groups. We have shown the effectiveness of the model of the proposed method of organizing check by examples.