{'fraction_non_alphanumeric': 0.02112676056338028, 'fraction_numerical': 0.0, 'mean_word_length': 5.252747252747253, '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 half a bit loss of robust source/channel codebooks

We consider the problem of choosing robust codebooks for rate-distortion relative to difference distortion measures, and for capacity-cost relative to additive noise channels. We define an information theoretic formula for the min-max redundancy associated with robust random source codes, and similarly for the loss of robust random channel codes. We then show that this min-max performance can be approached by structured, dithered lattice codebooks. Applications to coding with side information are discussed.