Coordinate transitivity of extended perfect codes and their SQS

09/17/2020
by   I. Yu. Mogilnykh, et al.
0

We continue the study of the class of binary extended perfect propelinear codes constructed in the previous paper and consider their permutation automorphism (symmetry) groups and Steiner quadruple systems. We show that the automorphism group of the SQS of any such code coincides with the permutation automorphism group of the code. In particular, the SQS of these codes are complete invariants for the isomorphism classes of these codes. We obtain a criterion for the point transitivity of the automorphism group of SQS of proposed codes in terms of GL-equivalence (similar to EA-type equivalence for permutations of F^r). Based on these results we suggest a new construction for coordinate transitive and neighbor transitive extended perfect codes.

READ FULL TEXT

page 1

page 2

page 3

page 4

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/30/2022

Involutory permutation automorphisms of binary linear codes

We investigate the properties of binary linear codes of even length whos...
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
04/30/2019

Permutation Code Equivalence is not Harder than Graph Isomorphism when Hulls are Trivial

The paper deals with the problem of deciding if two finite-dimensional l...
research
12/25/2022

P℘N functions, complete mappings and quasigroup difference sets

We investigate pairs of permutations F,G of 𝔽_p^n such that F(x+a)-G(x) ...
research
08/07/2018

Partially perfect hash functions for intersecting families

Consider a large network with unknown number of nodes. Some of these nod...

Please sign up or login with your details

Forgot password? Click here to reset