  We present algorithms for classification of linear codes over finite fields,
based on canonical augmentation and on lattice point enumeration. We apply
these algorithms to obtain classification results over fields with 2, 3 and 4
elements. We validate a correct implementation of the algorithms with known
classification results from the literature, which we partially extend to larger
ranges of parameters.
