Classification of Binary Self-Dual Codes of Length 40
Iliya Bouyukliev, Mariya Dzhumalieva-Stoeva, Venelin Monev · IEEE Transactions on Information Theory · 2015
An efficient isomorph-free generation algorithm for classification of binary self-dual codes with the minimum distance d = 4 is presented. It is combined with another isomorph-free generation algorithm for classification of self-dual codes with the minimum distance d ≥ 6. A complete classification of all binary self-dual codes of length 40 is given as a result.