Computer classification of linear codes
Information Theory
2021-09-21 v1 math.IT
Abstract
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.
Cite
@article{arxiv.2002.07826,
title = {Computer classification of linear codes},
author = {Iliya Bouyukliev and Stefka Bouyuklieva and Sascha Kurz},
journal= {arXiv preprint arXiv:2002.07826},
year = {2021}
}
Comments
18 pages, 9 tables; this paper is a merge and extension of arXiv:1907.10363 and arXiv:1912.09357