Two algorithms for the classification of linear codes over finite fields are presented. One of the algorithms is based on canonical augmentation and the other one on lattice point enumeration. New classification results over fields with 2, 3 and 4 elements are obtained.
1 January 1998 in IEEE Transactions on Information Theory
An efficient algorithm for classification of binary self-dual codes is presented. As an application, a complete classification of the self-dual codes of length 38 is given.