{'fraction_non_alphanumeric': 0.018442622950819672, 'fraction_numerical': 0.0, 'mean_word_length': 5.269230769230769, '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}}
Time varying convolutional codes for punctured turbocodes

In the area of digital communications, turbocodes provide a flexible way to design error-correcting codes which are decodable near the theoretical limits. Classical constructions use optimal fixed convolutional codes. However it has been proven that, in some cases, time varying convolutional codes outperform fixed codes in terms of minimum distance. In this paper, we discuss the use of these codes in the design of turbocodes.