2000 character limit reached
q-ary Propelinear Perfect Codes from the Regular Subgroups of the GA(r,q) and Their Ranks (2112.08659v1)
Published 16 Dec 2021 in math.CO, cs.IT, and math.IT
Abstract: We propose a new method of constructing q-ary propelinear perfect codes. The approach utilizes permutations of the fixed length q-ary vectors that arise from the automorphisms of the regular subgroups of the affine group. For any prime q it is shown that the new class contains an infinite series of q-ary propelinear perfect codes of varying ranks of growing length.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.