{'fraction_non_alphanumeric': 0.018315018315018316, 'fraction_numerical': 0.0, 'mean_word_length': 5.3076923076923075, '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}}
Unified system of encoding and decoding erasures and errors for algebraic geometry codes

In this paper, a fundamental lemma in algebraic coding theory is established, which is frequently appeared in the encoding and decoding for algebraic codes such as Reed-Solomon and algebraic geometry codes. This lemma states that two vector spaces, one corresponds to information symbols and the other is indexed by the support of Gröbner basis, are canonically isomorphic, and moreover, the isomorphism is given in terms of extension by linear feedback shift registers from Gröbner basis and discrete Fourier transforms. Next, we apply the lemma to unified system of encoding and decoding erasure-errors in algebraic geometry codes. Finally, we comment on an improved bound for the generic erasure-error correcting capabilities.