{'fraction_non_alphanumeric': 0.024886877828054297, 'fraction_numerical': 0.0, 'mean_word_length': 4.828947368421052, '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}}
On coding for Faster-Than-Nyquist signaling

In this paper, we study the design of sparse graph based codes for Faster-Than-Nyquist (FTN) signaling. Using an asymptotic approach based on EXIT charts, we show that good low-density parity check codes can be designed that perform well under iterative detection and decoding and that have better performance than a FTN scheme using a code optimized for the additive white Gaussian noise channel.