{'fraction_non_alphanumeric': 0.011544011544011544, 'fraction_numerical': 0.0, 'mean_word_length': 5.871287128712871, '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}}
Protecting convolution-type aritmetic array calculations with generalized cyclic codes

Fault-tolerance in dense high-speed arithmetic units that calculate convolutions between arrays of data is introduced through cyclic codes which are defined over the rings and fields commonly employed by such units. New systematic encoding and data manipulation techniques make the application of these generalized cyclic codes to error detection straightforward and efficient. The necessary overhead parity computations have complexity proportional to the number of parity symbols squared, whereas the error-detecting capability for both random and burst errors is directly related to this parity number.