Combinatorial polarization, code loops, and codes of high level

Simple item page
dc.creatorVojtěchovský, Petr
dc.date2007-01-24
dc.date.accessioned2026-07-07T07:42:52Z
dc.date.available2026-07-07T07:42:52Z
dc.descriptionWe first find the combinatorial degree of any map $f:V\to F$ 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.
dc.description9 pages
dc.identifierhttps://arxiv.org/abs/math/0701708
dc.identifierhttp://arxiv.org/abs/math/0701708
dc.identifierproceedings of CombinaTexas 2003, published in International Journal of Mathematics and Mathematical Sciences 29 (2004), 1533-1541
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/122608
dc.subjectGroup Theory
dc.subjectCombinatorics
dc.subject20N05, 05A10
dc.titleCombinatorial polarization, code loops, and codes of high level
dc.typetext

Files

Collections

arXiv