{'fraction_non_alphanumeric': 0.012062726176115802, 'fraction_numerical': 0.0012062726176115801, 'mean_word_length': 5.1940298507462686, '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}}
An Optimal Software Framework for Parallel Computation of CRC

CRC is a common error detection method used in different areas such as information storage and data communication. CRC depends on modulo-2 division by a predetermined divisor called the generator. In this method, the transmitter divides the message by the generator and concatenates the calculated residue to the message. CRC is not able to detect every kind of errors. The properties of the generator determine the range of errors which are detectable in the receiver side. The division operation is currently performed sequentially, so developing methods for parallel computation of the residue makes CRC suitable for network protocols and software applications. This paper presents a novel software framework for parallel computation of CRC using ODP polynomials.