A concatenation construction for propelinear perfect codes from regular subgroups of GA(r,2)

05/24/2019
by   I. Yu. Mogilnykh, et al.
0

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 concatenation construction-1981 [21] and the regular subgroups of the general affine group of the vector space over GF(2).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/16/2021

q-ary Propelinear Perfect Codes from the Regular Subgroups of the GA(r,q) and Their Ranks

We propose a new method of constructing q-ary propelinear perfect codes....
research
07/12/2018

A note on regular subgroups of the automorphism group of the linear Hadamard code

We consider the regular subgroups of the automorphism group of the linea...
research
06/30/2022

Projective tilings and full-rank perfect codes

A tiling of a finite vector space R is the pair (U,V) of its subsets suc...
research
04/23/2019

Obtaining binary perfect codes out of tilings

A translation-support metric (TS-metric) is a metric which is translatio...
research
09/17/2020

Coordinate transitivity of extended perfect codes and their SQS

We continue the study of the class of binary extended perfect propelinea...
research
02/05/2021

Combinatorial Differential Algebra of x^p

We link n-jets of the affine monomial scheme defined by x^p to the stabl...
research
12/08/2022

Linear and group perfect codes over skew fields and quasi skew fields

In this paper, we propose a general construction of linear perfect codes...

Please sign up or login with your details

Forgot password? Click here to reset