2020/02/18 by Iliya Bouyukliev, Stefka Bouyuklieva, Sascha Kurz
Computer Science · Mathematics · #cs.IT #math.IT
paper · pdf · doi:10.1109/tit.2021.3114280
18 pages, 9 tables; this paper is a merge and extension of arXiv:1907.10363 and arXiv:1912.09357
arxiv created 2020/02/18 · arxiv updated 2021/09/21
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.