A concatenation construction for propelinear perfect codes from regular subgroups of GA(r,2)
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).
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.