{'fraction_non_alphanumeric': 0.021455223880597014, 'fraction_numerical': 0.0018656716417910447, 'mean_word_length': 4.994413407821229, '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}}
Partition decoding for reed-solomon codes based on bit reliability

This study presents a partition decoding algorithm for an (mN, mK) binary image of an (N, K) Reed Solomon code over GF(2'"). A permutation is performed on a binary generator matrix of an RS code and a received vector, both of which are then partitioned into two submatrices and two subvectors. The first subvector of length N(m-1) associate with the first submatrix and the second subvector with the least subvector reliability value relates to the second submatrix. An MLD based on the first submatrix or a subfield subcode BCH generator matrix is employed to decode these two submatrices one after another. A codeword is finally outputted after performing the inverse permutation on a concatenation of code vectors decoded from these two decoding. Simulation results show that under a constraint of decoding complexity, a solution to decode binary images of long RS codes could be proposed partition decoding, which provides superior performance to GMD decoding with much lower complexity than the MLD.