Propelinear 1-Perfect Codes From Quadratic Functions

DOI10.1109/TIT.2014.2303158MaRDI QIDQ2986431zbMATH OpenOpenAlexFDO

Authors Vladimir N. Potapov, Denis S. Krotov

Publication date 16 May 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Combinatorial codes (94B25)

Abstract: Perfect codes obtained by the Vasil'ev--Sch"onheim construction from a linear base code and quadratic switching functions are transitive and, moreover, propelinear. This gives at least $exp(c{N}^2)$ propelinear $1$-perfect codes of length $N$ over an arbitrary finite field, while an upper bound on the number of transitive codes is $exp(C(NlnN{)}^2)$. Keywords: perfect code, propelinear code, transitive code, automorphism group, Boolean function.

Cited in

(6)

• A concatenation construction for propelinear perfect codes from regular subgroups of \(\mathrm{GA}(r,2)\)
• Systematic and nonsystematic perfect codes of infinite length over finite fields
• On separability of the classes of homogeneous and transitive perfect binary codes
• Transitive nonpropelinear perfect codes
• Constructions of transitive Latin hypercubeatin hypercubes
• On \(q\)-ary propelinear perfect codes based on regular subgroups of the general affine group

This page was built for publication: Propelinear 1-Perfect Codes From Quadratic Functions

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