The existence and uniqueness (up to equivalence defined below) of code loops was first established by R. Griess in [3]. Nevertheless, the explicit construction of code loops remained open until T. Hsu introduced the notion of symplectic cubic spaces and their Frattini extensions, and pointed out how the construction of code loops followed from the (purely combinatorial) result of O. Chein and E. Goodaire contained in [2]. Within this paper, we focus on their combinatorial construction and prove a more general result 2.1 using the language of derived forms.
@article{119176,
author = {Petr Vojt\v echovsk\'y},
title = {Combinatorial aspects of code loops},
journal = {Commentationes Mathematicae Universitatis Carolinae},
volume = {41},
year = {2000},
pages = {429-435},
zbl = {1042.94023},
mrnumber = {1780884},
language = {en},
url = {http://dml.mathdoc.fr/item/119176}
}
Vojtěchovský, Petr. Combinatorial aspects of code loops. Commentationes Mathematicae Universitatis Carolinae, Tome 41 (2000) pp. 429-435. http://gdmltest.u-ga.fr/item/119176/
Sporadic Groups, Cambridge Tracts in Mathematics 104 (1994), Cambridge University Press. | MR 1269103 | Zbl 0804.20011
Moufang loops with a unique nonidentity commutator (associator, square), J. Algebra 130 (1990), 369-384. (1990) | MR 1051308 | Zbl 0695.20040
Code loops, J. Algebra 100 (1986), 224-234. (1986) | MR 0839580 | Zbl 0589.20051
Moufang loops of class $2$ and cubic forms, Math. Proc. Camb. Phil. Soc., to appear. | MR 1735310 | Zbl 0962.20046
Derived Forms and Binary Linear Codes, Mathematics Report Number M99-10, Department of Mathematics, Iowa State University.