{'fraction_non_alphanumeric': 0.009041591320072333, 'fraction_numerical': 0.0, 'mean_word_length': 5.517647058823529, '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}}
Given Correlation Manifolds and their Application in Blind Channel Identification

This paper introduces the new objects named polynomial statistics. We discuss their properties and applicability to the problem of Blind Channel Identification which is a highly topical issue at the moment. This paper proposes a solution to this problem which is based on using polynomial representations of finite random sequence. Algorithms of Blind identification that was described in this paper use a factorization property of so-called given correlation manifolds.