{'fraction_non_alphanumeric': 0.013498312710911136, 'fraction_numerical': 0.0, 'mean_word_length': 5.054421768707483, '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}}
Successive iterative decoding of Reed Solomon codes using cryptographic hash codes as parity

Coding theory and Cryptography have common roots. Both the fields were introduced by Claude Shannon in his legendary work. The applications of both the fields are however quite different and therefore not significant research work has previously been done to investigate the connection between the both. In this work, those applications that require security in the form of cryptographic hash codes are considered and this cryptographic hash code is used as a means to improve the decoding results of concatenated Convolutional/Reed Solomon codes. Using the message digest, the results of concatenated decoding are enhanced and vice versa i.e. using the concatenated codes, the errors in the message digest are minimized. It is also demonstrated that a coding gain is achieved in both the cases.