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(cN^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(N\ln N)^2)$. Keywords: perfect code, propelinear code, transitive code, automorphism group, Boolean function.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
