{'fraction_non_alphanumeric': 0.0273972602739726, 'fraction_numerical': 0.0091324200913242, 'mean_word_length': 5.097222222222222, '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}}
LDPC codes for compression of multi-terminal sources with hidden Markov correlation

We propose the use of low-density parity-check (LDPC) codes for compression of memory correlated binary sources. The correlation model between the sources is defined by a hidden Markov model. The resulting performance is close to the theoretical Slepian-Wolf (1973) limit. No information about the sources statistics is required in the encoding process.