{'fraction_non_alphanumeric': 0.008917197452229299, 'fraction_numerical': 0.0, 'mean_word_length': 4.909774436090226, '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}}
Improving the Stability of the DFT Error Recovery Codes by Using the Vandermonde Fast Decoding Algorithm

Discrete Fourier transform (DFT) error recovery codes have been extended from the Galois field of numbers to the real and complex fields of numbers. The arithmetic in the complex field is much easier compared to the Galois field. But the computational error always exists in every calculation that is performed on the real and complex fields of numbers. This paper proposes a new algorithm for decoding DFT error recovery codes on the real and complex fields of numbers. It is shown that the proposed algorithm has lower computational complexity compared to the other DFT decoding algorithms. The proposed method is also more stable than the current methods of decoding DFT codes