2000 character limit reached
A concatenation construction for propelinear perfect codes from regular subgroups of GA(r,2) (1905.10005v2)
Published 24 May 2019 in math.CO, cs.IT, and math.IT
Abstract: A code $C$ is called propelinear if there is a subgroup of $Aut(C)$ of order $|C|$ acting transitively on the codewords of $C$. In the paper new propelinear perfect binary codes of any admissible length more than $7$ are obtained by a particular case of the Solov'eva concatenation construction--1981 and the regular subgroups of the general affine group of the vector space over $GF(2)$.
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.
