{'fraction_non_alphanumeric': 0.012437810945273632, 'fraction_numerical': 0.0, 'mean_word_length': 5.24031007751938, '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}}
Rate-adaptive polar codes for distributed source coding

In this paper, we consider how polar codes can be used for distributed source coding configuration regardless of the statistical dependency of correlated binary sources. The polar code encoder transmits the syndrome bits which have high entropy first to the decoder for optimal compression. However, the optimal order for transmitting syndrome bits varies with the dependency of correlated sources. It means that the encoder needs to know the correlation of sources for optimal compression. In this point of view, we propose the construction method of the optimal sequence for syndrome bits. The sequence constructed with the proposed method shows the optimal compression rate without knowledge of correlation of sources at the polar code encoder.