{'fraction_non_alphanumeric': 0.0287569573283859, 'fraction_numerical': 0.0, 'mean_word_length': 5.236994219653179, '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}}
Design of Efficient Convolutional and Serially Concatenated Convolutional Codes with A-Priori Information

In this paper, we focus on the design of optimized binary convolutional codes (CCs) and serially concatenated convolutional codes (SCCCs) in the presence of a-priori information (API) at the receiver. First, we propose a design criterion for CCs based on the minimization of the bit error proabability (BEP). In this case, relevant performance gains, with respect to previously proposed CCs, are obtained. These gains persist even in the presence of estimation errors on the API. Then, we apply the same BEP-based design criterion to SCCCs and derive good encoders' structures. In the SCCC case with API at the receiver, simulation results show substantial gains with respect to previously proposed parallel concatenated convolutional coding (PCCCing) schemes optimized under the assumption of no API at the decoder. Moreover, in the presence of strong API the proposed SCCCs allow to approach the Shannon limit (SL) more than any previously proposed turbo coding scheme.