Representations of code loops by binary codes
Group Theory
2026-01-06 v1
Abstract
Code loops are Moufang loops constructed from doubly even binary codes. Then, given a code loop , we ask which doubly even binary code produces . In this sense, is called a representation of . In this article we define and show how to determine all minimal and reduced representations of nonassociative code loops of rank and .
Keywords
Cite
@article{arxiv.2601.02332,
title = {Representations of code loops by binary codes},
author = {Rosemary Miguel Pires and Alexandre Grishkov and Marina Rasskazova},
journal= {arXiv preprint arXiv:2601.02332},
year = {2026}
}
Comments
30 pages, 19 figures. Revised and extended version of arXiv:1909.05143, following referee reports. Submitted to the International Journal of Algebra and Computation