{'fraction_non_alphanumeric': 0.02392947103274559, 'fraction_numerical': 0.0, 'mean_word_length': 4.932835820895522, '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}}
Some properties of Homogenous Trellis-Constrained Codes

We consider Homogenous Trellis-Constrained Codes (HTCC), a generalization of Turbo-codes where all bits are constrained. No efficient decoding algorithm is known for these codes, so our results are primarily of theoretical interest. We propose a technique to derive an upper bound for the maximum-likelihood (ML) decoding of BSC errors. Our technique is based on the weight distributions of the constituent codes and it can also be used when a specific number of errors e is known. We observe that with an ML-decoder some HTCC codes exhibit an error correcting performance close to that of random codes. For those codes we also observe a significant performance gap between ML-decoding and practical decoding based on belief-propagation.