{'fraction_non_alphanumeric': 0.01875901875901876, 'fraction_numerical': 0.0, 'mean_word_length': 5.3090909090909095, '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}}
Subspace algorithms for error localization with DFT codes

We propose two subspace algorithms for error localization with quantized DFT codes. The algorithms are similar to the MUSIC and the minimum-norm algorithms employed in array signal processing for direction of arrival (DOA) estimation. We present the algorithms in a generalized form with a variable dimension syndrome covariance matrix. Simulation results show that their localization performances are similar, and they achieve the peak values when the rank of the covariance matrix reaches the maximum value. They also perform better than the coding theoretic approach over a broad range of channel-error-to-quantization-noise ratio.