Combinatorial polarization, code loops, and codes of high level
2004 ◽
Vol 2004
(29)
◽
pp. 1533-1541
◽
Keyword(s):
We first find the combinatorial degree of any mapf:V→F, whereFis a finite field andVis a finite-dimensional vector space overF. 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 possess at most two squares. The construction yields binary codes of high divisibility level with prescribed Hamming weights of intersections of codewords.
2002 ◽
Vol 73
(1)
◽
pp. 85-96
◽
1982 ◽
Vol 25
(2)
◽
pp. 133-139
◽
1986 ◽
Vol 69
(4)
◽
pp. 37-46
◽
1982 ◽
Vol 86
◽
pp. 229-248
◽