{'fraction_non_alphanumeric': 0.02031063321385902, 'fraction_numerical': 0.0035842293906810036, 'mean_word_length': 4.943262411347518, '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}}
Nested convolutional/turbo codes for the binary Wyner-Ziv problem

We show how concatenated (convolutional) codes can be used to compress close to the Wyner-Ziv limit for binary sources. Focusing on the case of lossy compression of an equiprobable memoryless binary source with side information at the decoder, the approach is based on nested binary linear codes, which is the extension of Wyner's lossless compression scheme to the lossy case proposed by Shamai, Verdu and Zamir. Based on our previous work on lossless compression with concatenated codes, we are able to combine the only two previously suggested nested schemes into a novel turbo scheme with improved performance. Our scheme can come within 0.09 bits from the theoretical limit, which to our knowledge is the first result ever reported for the binary Wyner-Ziv problem.