Representations of code loops by binary codes
Representation Theory
2019-09-12 v1
Abstract
Code loops are Moufang loops constructed from doubly even binary codes. Then, given a code loop L, we ask which doubly even binary code V produces L. In this sense, V is called a representation of L. In this article we define and determine all minimal and reduced representations of nonassociative code loops of rank 3 and 4.
Keywords
Cite
@article{arxiv.1909.05143,
title = {Representations of code loops by binary codes},
author = {Rosemary Miguel Pires and Alexandre Grishkov and Marina Rasskazova},
journal= {arXiv preprint arXiv:1909.05143},
year = {2019}
}
Comments
16 pages. arXiv admin note: text overlap with arXiv:1412.2185