{'fraction_non_alphanumeric': 0.01405152224824356, 'fraction_numerical': 0.0, 'mean_word_length': 5.7936507936507935, '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}}
Diophantine Index Assignments for Distributed Source Coding

We consider the design of index assignments for the distributed source coding problem in large-scale sensor networks. Using basic tools from number theory, specifically Diophantine analysis, we provide a framework for constructing cyclic index assignments that have very low complexity yet perform very close to fundamental bounds provided by rate-distortion theory.