{'fraction_non_alphanumeric': 0.007194244604316547, 'fraction_numerical': 0.0, 'mean_word_length': 5.9625, '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}}
Research on Construction of Perfect Punctured Binary Sequence Pairs and its Application in Spread Frequency Telecommunication

This paper presents some combinatorial admissibility conditions for searching the perfect punctured binary sequence pairs. Some computer searching results and construction methods are presented. The performances of perfect punctured binary sequence pairs are analyzed and compared with cold code in spread frequency telecommunication. In bit error rate, the performance of punctured binary sequence pairs are as good as gold code