{'fraction_non_alphanumeric': 0.04352678571428571, 'fraction_numerical': 0.027901785714285716, 'mean_word_length': 4.862745098039215, '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}}
Algebraic and linear programming decoding of the (73, 37, 13) quadratic residue code

In this paper1, a method to search the subsets I and J needed in computing the unknown syndromes for the (73, 37, 13) quadratic residue (QR) code is proposed. According to the resulting I and J, one computes the unknown syndromes, and thus finds the corresponding error-locator polynomial by using an inverse-free BM algorithm. Based on the modified Chase-II algorithm, the performance of soft-decision decoding for the (73, 37, 13) QR code is given. This result is never seen in the literature, to our knowledge. Moreover, the error-rate performance of linear programming (LP) decoding for the (73, 37, 13) QR code is also investigated, and LP-based decoding is shown to be significantly superior in performance to the algebraic soft-decision decoding while requiring almost the same computational complexity.