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

DOI10.33048/SEMI.2019.16.119zbMATH Open1457.94238arXiv1905.10005OpenAlexW3015595171MaRDI QIDQ2279478FDOQ2279478

Authors: Ivan Yu. Mogilnykh, Faina I. Solov'eva 

Publication date: 12 December 2019

Published in: Sibirskie Elektronnye Matematicheskie Izvestiya (Search for Journal in Brave)

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)$.

Full work available at URL: https://arxiv.org/abs/1905.10005

Recommendations

• Propelinear codes related to some classes of optimal codes
• Structural properties of binary propelinear codes
• Translation-invariant propelinear codes
• Transitive nonpropelinear perfect codes
• On the number of nonequivalent propelinear extended perfect codes

zbMATH Keywords

transitive actionpropelinear codeHamming coderegular subgroupperfect codeMollard codeconcatenation construction

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Cites Work

• Structural properties of binary propelinear codes
• Regular subgroups of the affine group
• On separability of the classes of homogeneous and transitive perfect binary codes
• Propelinear 1-Perfect Codes From Quadratic Functions
• Title not available (Why is that?)
• The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
• A characterization of 1-perfect additive codes
• The Perfect Binary One-Error-Correcting Codes of Length 15: Part II—Properties
• On binary 1-perfect additive codes: some structural properties
• A Generalized Parity Function and Its Use in the Construction of Perfect Codes
• A Combinatorial Construction of Perfect Codes
• On the number of nonequivalent propelinear extended perfect codes
• Title not available (Why is that?)
• Ranks of propelinear perfect binary codes
• The rank and kernel of extended 1-perfect Z/sub 4/-linear and additive non- Z/sub 4/-linear codes
• Translation-invariant propelinear codes
• Construction of ${\BBZ}_4$-Linear Reed–Muller Codes
• Title not available (Why is that?)
• On $Z_{2^k}$-Dual Binary Codes
• A note on regular subgroups of the automorphism group of the linear Hadamard code

Cited In (9)

• Transitive nonpropelinear perfect codes
• Constructions and invariants of optimal codes in the Lee metric
• On \(q\)-ary propelinear perfect codes based on regular subgroups of the general affine group
• Propelinear codes related to some classes of optimal codes
• Structural properties of binary propelinear codes
• On extending propelinear structures of the Nordstrom-Robinson code to the Hamming code
• Title not available (Why is that?)
• Ranks of propelinear perfect binary codes
• Coordinate transitivity of a class of extended perfect codes and their SQS

This page was built for publication: A concatenation construction for propelinear perfect codes from regular subgroups of \(\mathrm{GA}(r,2)\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2279478)