{'fraction_non_alphanumeric': 0.013725490196078431, 'fraction_numerical': 0.0, 'mean_word_length': 5.551282051282051, '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}}
Optimal Multiple-Bit Huffman Decoding

A variable-bit look-ahead Huffman decoding problem is investigated in this paper. The objective is to maximize the decoding throughput rate by exploiting different equivalent state diagrams. The decoding throughput rate is estimated based on the state transition probability of the corresponding Huffman encoding table. We propose an efficient algorithm to search for a heuristic solution that usually yields very good optimization results in polynomial computation time.