{'fraction_non_alphanumeric': 0.0280437756497948, 'fraction_numerical': 0.0013679890560875513, 'mean_word_length': 5.360869565217391, '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}}
Graph Theory Assisted Bit-to-Index-Combination Gray Coding for Generalized Index Modulation

Generalized index modulation (GIM) which implicitly conveys information by the activated indices is a promising technique for next-generation wireless networks. Due to the prohibitive challenge of bit-to-index combination (IC) mapping optimization, conventional GIM system obtains the bit-to-IC mapping table randomly, which may suffer from some performance loss. To circumvent this issue, we propose a low-complexity graph theory assisted bit-to-IC gray coding for GIM systems by minimizing the average hamming distance (HD) between any two ICs having one different value. Specifically, we decompose and transform the optimization problem into two subproblems using the graph theory, i.e., 1) Select an IC set whose corresponding graph has the minimum degree; 2) Design a bit-to-IC mapping principle to minimize the weight of the selected graph. Low-complexity algorithms are developed to solve the subproblems with a significant reduced complexity. Both simulation and theoretical results are shown that the GIM systems with our proposed mapping table are capable of providing significant performance gains over the conventional counterparts without the need for any additional feedback-link and without extra computational complexity. It is also shown that the proposed bit-to-IC mapping table is straightforward for any GIM systems over generalized fading channels.