{'fraction_non_alphanumeric': 0.018272425249169437, 'fraction_numerical': 0.0, 'mean_word_length': 5.626373626373627, '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}}
Gradient Decoding Revisited

Modern coding applications, including dirty paper coding and information hiding, hinge critically on a classical 'general decoding problem,' known to be NP hard. Various attempts to find good solutions at reasonable complexity can be traced throughout the decades, most recently with attempts to achieve the rate-distortion bound in code word quantization. Here we take a step back to examine two computationally simple procedures in this direction: gradient decoding and a simple yet surprisingly effective variant on belief propagation that we dub truthiness propagation.