{'fraction_non_alphanumeric': 0.02066115702479339, 'fraction_numerical': 0.0, 'mean_word_length': 6.198019801980198, '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}}
Redundancy-complexity tradeoff of multiresolution coding for successively refinable sources

In this paper, we investigate the rate-distortion performance of multiresolution encoding algorithms for successively refinable sources, including block codes and trellis codes. Our random coding arguments not only support the results of simulation-based experiments, such as tree structured vector quantization (TSVQ) and multistage trellis coded quantization (MSTCQ), but also provides some information theoretic considerations to understand the efficiency of such existing algorithms. In fact, the redundancy analysis that we developed is a practical generalization of the Shannon source coding theorem to the more concrete cases.