Combinatorial polarization, code loops, and codes of high level

DOI10.1155/S0161171204306241MaRDI QIDQ1774772zbMATH OpenOpenAlexFDO

Authors Petr Vojtěchovský

Publication date 18 May 2005

Published in International Journal of Mathematics and Mathematical Sciences (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/0701708, https://eudml.org/doc/51905

zbMATH Keywords

character sumscode loopscombinatorial polarizationweight of codewords

Mathematics Subject Classification ID

Factorials, binomial coefficients, combinatorial functions (05A10) Loops, quasigroups (20N05) Theory of error-correcting codes and error-detecting codes (94B99)

Abstract: We first find the combinatorial degree of any map $f:VoF$ where $F$ is a finite field and $V$ is a finite-dimensional vector space over $F$. We then simplify and generalize a certain construction due to Chein and Goodaire that was used in characterizing code loops as finite Moufang loops that posses at most two squares. The construction yields binary codes of high divisibility level with prescribed Hamming weights of intersections of codewords.

Recommendations

• scientific article; zbMATH DE number 2061611
• Code loops in both parities
• Code loops in dimension at most \(8\)
• Explicit constructions of code loops as centrally twisted products
• Direct construction of code loops.

Cited in

(3)

• scientific article; zbMATH DE number 2061611 (Why is no real title available?)
• Symmetric multilinear forms and polarization of polynomials
• Code loops in both parities

This page was built for publication: Combinatorial polarization, code loops, and codes of high level

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