{'fraction_non_alphanumeric': 0.02355072463768116, 'fraction_numerical': 0.0, 'mean_word_length': 4.946236559139785, '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}}
Very-high rate space-time coding

A space-time coding method with low decoding complexity suitable for large numbers of antennas and high data rates is presented. High dimensionality is accommodated through use of a sub-optimal receiver that efficiently locates short vectors in a high-dimensional lattice. These vectors are used to approximate the transmitted symbol a-posteriori probabilities, which are refined by an outer serially concatenated code. We show that the codes can achieve hundreds of bits per channel use at low signal-to-noise ratios.