{'fraction_non_alphanumeric': 0.016793893129770993, 'fraction_numerical': 0.0, 'mean_word_length': 4.963636363636364, '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}}
Capacity and coding for flat fading channels without channel state information

This paper presents a method for calculating arbitrarily tight upper and lower bounds on the capacity of a flat fading channel with M-ary inputs, where the fading process is modelled as a Gaussian random process with any spectral density. Neither the transmitter nor the receiver knows the channel state. The paper also presents a practicable method for adapting any family of codes designed for i.i.d. channels to work on correlated fading channels. Thus, the near-capacity performance of existing codes with iterative decoders can be translated directly to fading channels.