{'fraction_non_alphanumeric': 0.014563106796116505, 'fraction_numerical': 0.0, 'mean_word_length': 5.770491803278689, '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}}
Hardware analysis of decoding algorithms for AGC

The algebraic-geometry (AG) family of codes contains sequences with excellent asymptotic behavior, but only few pieces work treating their hardware implementation can be found. In this work, the authors investigated some algorithms for decoding AG codes attempting to identify the differences between these algorithms from a hardware implementation point of view