Relating Doubly-Even Error-Correcting Codes, Graphs, and Irreducible Representations of N-Extended Supersymmetry
From MaRDI portal
Publication:6209736
arXiv0806.0051MaRDI QIDQ6209736FDOQ6209736
Authors: C. F. Doran, M. G. Faux, S. J. jun. Gates, T. Hübsch, K. M. Iga, G. D. Landweber 
Publication date: 30 May 2008
Abstract: Previous work has shown that the classification of indecomposable off-shell representations of N-supersymmetry, depicted as Adinkras, may be factored into specifying the topologies available to Adinkras, and then the height-assignments for each topological type. The latter problem being solved by a recursive mechanism that generates all height-assignments within a topology, it remains to classify the former. Herein we show that this problem is equivalent to classifying certain (1) graphs and (2) error-correcting codes.
This page was built for publication: Relating Doubly-Even Error-Correcting Codes, Graphs, and Irreducible Representations of N-Extended Supersymmetry
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6209736)
