{'fraction_non_alphanumeric': 0.0267639902676399, 'fraction_numerical': 0.0024330900243309003, 'mean_word_length': 4.755244755244755, '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}}
A new construction of irregular LDPC convolutional codes with cycle removal

In this paper, a new construction of irregular low-density parity-check convolutional codes (LDPC-CCs) is presented. Both upper and lower bounds on the free distance are derived as well. Compared with previously constructed irregular LDPC-CCs, our design can not only avoid a girth less than 8 but also provide an enlarged free distance. Since some undesired cycles occur due to the binomial terms in the parity-check matrices of general LDPC-CCs, we provide a specific procedure to remove this kind of length-8 cycles. It can also be applied to our irregular construction. Simulation results show that the codes based on the new construction and the cycle-removal procedure can achieve better bit-error-rate performance and a lower error-floor.