{'fraction_non_alphanumeric': 0.016129032258064516, 'fraction_numerical': 0.008064516129032258, 'mean_word_length': 5.056910569105691, '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}}
The performance of polar codes in distributed source coding

The application of polar coding to rate-adaptive asymmetric Slepian-Wolf coding is considered. The encoder transmits the syndrome set which includes high entropy bits to the decoder to achieve the optimal compression. It means that the encoder must know the correlation between two sources and the syndrome set varies according to this correlation. In this paper, we propose polar source coding scheme with the construction which is designed by density evolution for the target range of crossover probabilities from 0.01 to 0.25. This proposed scheme performs closely to the theoretical Slepian Wolf bound and can be comparable with Low Density Parity Check Accumulate (LDPCA) codes.