{'fraction_non_alphanumeric': 0.015037593984962405, 'fraction_numerical': 0.0, 'mean_word_length': 5.126436781609195, '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}}
A generalisation of quadratic residue codes to the case of cubic and biquadratic residues

In this paper, we consider a generalisation of quadratic residue codes to the cases of higher power residues. Such a generalisation enhances the information transmission rate with the use of such codes as compared with the quadratic-residue codes, at a sacrifice in the lower bound for the code distance, though. We consider the construction of generating polynomials for such codes, which allows to write explicitly their generating matrix.