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

12/16/2021
by   Ivan Mogilnykh, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/24/2019

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

A code C is called propelinear if there is a subgroup of Aut(C) of order...
research
10/12/2021

An enumeration of 1-perfect ternary codes

We study codes with parameters of the ternary Hamming (n,3^n-m,3) code, ...
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
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...
research
12/07/2022

Multifold 1-perfect codes

A μ-fold (multifold) 1-perfect code in any graph is a set C of vertices ...
research
11/15/2019

Two-weight codes over the integers modulo a prime power

Let p be a prime number. Irreducible cyclic codes of length p^2-1 and di...
research
11/11/2021

Optimal Probing Sequences for Polarization-Multiplexed Coherent Phase OTDR

We introduce dual-polarization probing codes based on two circularly shi...

Please sign up or login with your details

Forgot password? Click here to reset