{'fraction_non_alphanumeric': 0.015399422521655439, 'fraction_numerical': 0.0019249278152069298, 'mean_word_length': 4.777777777777778, '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}}
Method of Forming the Ring Codes

The article considers a method of forming a ring code, which was created to compress information and protect it unauthorized access. The structure of the forming matrix and the mathematical model of the ring code formation are presented. To identify the ring codes the shift indexes vector is proposed. An algorithm for constructing a shift indexes vector is given by the example of a specific ring code. The properties of shift indexes vector, created by summing the number of the units obtained from binary transformations of the XOR, OR, AND elements of the initial sequence (first line) of the ring code and successively on each subsequent line, are investigated. The formulas for the summing decimal values of the elements of the shift indexes vector are given. This method can be used to build an effective channel for the transmission of the future network. There is determined that compressing the information with ring code is 2.7 times higher compared with the amount of information transmitted.