Two algorithms for the classification of linear codes over finite fields are presented. One is based on canonical augmentation and other one lattice point enumeration. New results with 2, 3 4 elements obtained.

A subspace of matrices in F m×n qe can be naturally embedded as a xmlns:xlink="http://www.w3.org/1999/xlink">em×en xmlns:xlink="http://www.w3.org/1999/xlink">q with the property...