{'fraction_non_alphanumeric': 0.012360939431396786, 'fraction_numerical': 0.0, 'mean_word_length': 4.827338129496403, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 1, '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}}
Transform domain characterization of Abelian codes

Abelian codes constitute a class of codes that includes cyclic codes as a special case. It is shown that the general class of abelian codes can be characterized in the transform domain using the discrete Fourier transform (DFT) over finite fields with the appropriate mixed radix number system as the indexing scheme for DFT coefficients. A simple transform domain description for dual codes of abelian codes is also obtained. Using this description the idempotent generator of the dual of a given abelian code can be easily obtained. Finally, it is shown that in the case of cyclic codes which can be considered as abelian codes also, one can work in smaller extension fields compared to the extension fields if they were considered as cyclic codes only. >