{'fraction_non_alphanumeric': 0.01680672268907563, 'fraction_numerical': 0.008403361344537815, 'mean_word_length': 5.0, '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}}
Unknown syndrome calculation in algebraic decoding of a class of cyclic codes

Recently, two novel matrices whose some entries are not syndromes and other entries are known syndromes have been presented to generate weak-locator polynomials needed in decoding the ternary quadratic residue code of length 61. This paper proposes a new unknown syndrome calculation for a class of cyclic codes and a completely algebraic decoding of the (23, 11, 9) ternary quadratic residue code up to actual minimum distance. For exactly four errors, the decoding algorithm developed here has to use the unknown syndrome, which appears in an entry of the above-mentioned matrix. The actual value of such an unknown syndrome can be determined precisely by the ratio of two determinants of matrices obtained from any one of the above-mentioned matrices.