{'fraction_non_alphanumeric': 0.020689655172413793, 'fraction_numerical': 0.0022988505747126436, 'mean_word_length': 4.317073170731708, '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}}
Upper bounds for a Commutative Group Code

Good spherical codes have large minimum squared distance. An important quota in the theory of spherical codes is the maximum number of points M(n, rho) displayed on the sphere Sn-1, having a minimum squared distance rho. The aim of this work is to study this problem within the class of group codes. We establish a bound for the number of points of a commutative group code in dimension even.