{'fraction_non_alphanumeric': 0.01487603305785124, 'fraction_numerical': 0.003305785123966942, 'mean_word_length': 4.3628318584070795, '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}}
Designs and codes from fixed points of alternating groups

Abstract In this paper, we construct some designs invariant under the alternating groups, using a method that has been recently introduced by Moori. We consider the action of An on the 2-subsets of a set of size n. The blocks of the designs are the conjugates of the set of fixed-points of the permutation with respect to this action. For every element we give explicit formulae to compute the parameters of the designs based on the cycle representation of g. We also prove that the binary codes of these designs have minimum distances at most 4.