Codes and Supersymmetry in One Dimension

Abstract

Adinkras are diagrams that describe many useful supermultiplets in D=1 dimensions. We show that the topology of the Adinkra is uniquely determined by a doubly even code. Conversely, every doubly even code produces a possible topology of an Adinkra. A computation of doubly even codes results in an enumeration of these Adinkra topologies up to N=28, and for minimal supermultiplets, up to N=32.Comment: 48 pages, a new version that combines arXiv:0811.3410 and parts of arXiv:0806.0050, for submission for publicatio