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.

Review text

The combinatorial degree of a polynomial \(f: V\to F,\) where \(V\) is a finite dimensional vectorspace over a field \(F\) was introduced by \textit{H. N. Ward} [Discrete Math. 26, 185--197 (1979; Zbl 0411.05008)] and it was studied in the case when the field is of characteristic \(0\). In this paper the author proves that the combinatorial degree of \(f\) for the finite field \(F_{p^m},\) equals to the largest value of the sum \(p\)-weights of the exponents for the monomials appearing in the polynomial~\(f\). \textit{O. Chein} and \textit{E. G. Goodaire} [J. Algebra 130, No. 2, 369--384 (1990; Zbl 0695.20040)] characterized the class of loops called code loops (by Griess) as finite Moufang loops having at most two squares. The author also gave a generalization of these code loops to the binary codes of arbitrary level and 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)

• Symmetric multilinear forms and polarization of polynomials
• scientific article; zbMATH DE number 2061611 (Why is no real title available?)
• 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)