{'fraction_non_alphanumeric': 0.013157894736842105, 'fraction_numerical': 0.0, 'mean_word_length': 4.98876404494382, '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 the BCJR algorithm for rate-distortion source coding

The BCJR algorithm is an important method of channel decoding. We extend it here to rate-distortion encoding. The arguments begin from source coding principles and make no use of channel coding or soft output ideas. An important role is played by codeword ensembles with equiprobable reproducer letters. The BCJR method is demonstrated by tests of a tailbiting BCJR with the Gaussian source. The outcome improves Viterbi algorithm performance at short and medium blocklengths