Abstract
Code loops were introduced by R.L. Griess Jr. [Code loops, J. Algebra 100 (1) (1986) 224–234] and T. Hsu [Explicit constructions of code loops as centrally twisted products, Math. Proc. Cambridge Philos. Soc. 128 (2) (2000) 223–232] gave methods to construct the corresponding code loop from any given doubly even binary code; both these methods used some kind of induction. In this paper, we present a global construction of the loop, where we apply the correspondence between the concepts of Moufang loops and groups with triality.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.