{'fraction_non_alphanumeric': 0.017361111111111112, 'fraction_numerical': 0.0, 'mean_word_length': 5.503759398496241, '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}}
Graphical models for coded data transmission over inter-symbol interference channels

We derive graphical models for coded data transmission over channels introducing inter-symbol interference. These models are factor graph descriptions of the transmitter section of the communication system, which serve at the same time as a framework to define the corresponding receiver. The graph structure governs the complexity and nature (e.g. non-iterative, iterative) of the receiver algorithm. A particular graph yields several algorithms optimizing various cost functions depending on the choice of messages communicated along the edges of the graph. We study these different outcomes of message passing and how the corresponding receiver algorithms are related to existing ones. We also devise strategies to find suitable graphs for communication problems of interest.