Computer Classification of Linear Codes

DOI10.1109/TIT.2021.3114280MaRDI QIDQ5032620zbMATH OpenOpenAlexFDO

Authors Stefka Bouyuklieva, Sascha Kurz, Iliya G. Bouyukliev

Publication date 17 February 2022

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2002.07826

zbMATH Keywords

algorithmscanonical augmentationclassification of linear codes over finite fieldslattice point enumeration

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

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.

Cited in

(13)

• On the classification of unitals on 28 points of low rank
• On the nonexistence of ternary linear codes attaining the Griesmer bound
• The equivalence of linear codes implies semi-linear equivalence
• On strongly walk regular graphs, triple sum sets and their codes
• Classification of linear codes by extending their residuals
• The program \textsc{Generation} in the software package \textsc{QextNewEdition}
• Classification of \((3 \bmod 5)\) arcs in \(\mathrm{PG}(3,5)\)
• Vector space partitions of GF(2)^8
• Dual transform and projective self-dual codes
• Lengths of divisible codes: the missing cases
• Computer classification of linear codes based on lattice point enumeration
• A conjecture on the minimum length of linear codes over finite fields
• Trifferent codes with small lengths

This page was built for publication: Computer Classification of Linear Codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5032620)