A concatenation construction for propelinear perfect codes from regular subgroups of GA(r,2)
Combinatorics
2019-12-17 v2 Information Theory
math.IT
Abstract
A code is called propelinear if there is a subgroup of of order acting transitively on the codewords of . In the paper new propelinear perfect binary codes of any admissible length more than 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 .
Keywords
Cite
@article{arxiv.1905.10005,
title = {A concatenation construction for propelinear perfect codes from regular subgroups of GA(r,2)},
author = {I. Yu. Mogilnykh and F. I. Solov'eva},
journal= {arXiv preprint arXiv:1905.10005},
year = {2019}
}