{'fraction_non_alphanumeric': 0.04145077720207254, 'fraction_numerical': 0.0, 'mean_word_length': 5.236559139784946, '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}}
Generalized space-time shift keying: Randomized bitwise Markov chain Monte Carlo detection and code design

In this paper, the low-complexity near-optimal (LCNO) detector and code design for the generalized space-time shift keying (G-STSK) scheme are studied. First, the LCNO randomized bitwise Markov chain Monte Carlo (R-b-MCMC) detector is presented. Next, the low-density parity-check code is optimized based on the extrinsic-information transfer chart technique. Simulation results are provided to demonstrate the performance of the proposed detector and the optimized code.