{'fraction_non_alphanumeric': 0.02249718785151856, 'fraction_numerical': 0.0, 'mean_word_length': 5.402877697841727, '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 LDPC decoding with natural redundancy

Big-data storage has substantial challenges due to accumulative noise in storage media. To ensure its long-term reliability, new techniques for error correction are being explored. This paper studies how to discover natural redundancy in data and use it for error correction. It explores the combination of natural redundancy decoding with low-density parity-check (LDPC) codes for enhanced error-correction performance. It derives analytical equations for the density evolution of LDPC decoding given information from natural-redundancy decoders. It proposes a theoretical model for compressed languages, and studies the performance of iterative decoding between the LDPC decoder and the natural-redundancy decoder. It also presents an upper bound to the code sizes of error-correcting codes given the assistance from natural-redundancy decoders.