{'fraction_non_alphanumeric': 0.047692307692307694, 'fraction_numerical': 0.0, 'mean_word_length': 4.470588235294118, '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}}
On systematic encoding for Blaum-Roth codes

We propose a new systematic encoding procedure for Blaum-Roth codes, i.e., Reed-Solomon(RS) codes over the polynomial rings modulo equation over GF(q), where p is a prime. Our method generalizes the interpolation-based erasure-only decoder for RS codes proposed by D.J.J. Versfeld et al., which is efficient for low-rate RS codes. Later, we derive a systematic encoder from this decoder, since encoding can be implemented as a special case of decoding. Compared to the systematic encoding procedure introduced by M. Blaum an R. Roth, our encoding procedure is very efficient for low-rate Blaum-Roth codes.