{'fraction_non_alphanumeric': 0.016736401673640166, 'fraction_numerical': 0.0, 'mean_word_length': 5.018867924528302, '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}}
ADAPTIVE ERROR RESTRICTED MAP DECODING OF VLC

Joint source channel techniques based on variable-length coding (VLC) have been widely used, particularly in video coding. One of the most famous methods of decoding VLC is optimal maximum a posteriori (MAP) decoder based on directed graph search and soft-input theories. Because the computation complexity of this method is square to the bit numbers of a packet, many techniques have been proposed to reduce the complexity of VLC decoding. In this paper, we propose an error restricted algorithm of heuristic graph search in VLC decoding and compare it with existing algorithms. This paper also illustrates the relations between the reduced complexity and the increased error rates, and figures out a break point at which we can maximize decoding speed with the given error rate threshold. Experimental results of our algorithm show good performance and low complexity when it is extended to adaptive manner.