On the classification and enumeration of self-dual codes

Citations of this article
Mendeley users who have this article in their library.


A complete classification is given of all [22, 11] and [24, 12] binary self-dual codes. For each code we give the order of its group, the number of codes equivalent to it, and its weight distribution. There is a unique [24, 12, 6] self-dual code. Several theorems on the enumeration of self-dual codes are used, including formulas for the number of such codes with minimum distance ≥ 4, and for the sum of the weight enumerators of all such codes of length n. Selforthogonal codes which are generated by code words of weight 4 are completely characterized. © 1975.




Pless, V., & Sloane, N. J. A. (1975). On the classification and enumeration of self-dual codes. Journal of Combinatorial Theory, Series A, 18(3), 313–335. https://doi.org/10.1016/0097-3165(75)90042-4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free