Computer Classification of Linear Codes

DOI10.1109/TIT.2021.3114280zbMath1489.94132arXiv2002.07826OpenAlexW3009019627MaRDI QIDQ5032620

Sascha Kurz, Stefka Bouyuklieva, 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 augmentationlattice point enumerationclassification of linear codes over finite fields

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Related Items (8)

On the nonexistence of ternary linear codes attaining the Griesmer bound ⋮ Classification of Linear Codes by Extending Their Residuals ⋮ The Program Generation in the Software Package QextNewEdition ⋮ The equivalence of linear codes implies semi-linear equivalence ⋮ Classification of \((3 \bmod 5)\) arcs in \(\mathrm{PG}(3,5)\) ⋮ Vector space partitions of GF(2)^8 ⋮ On strongly walk regular graphs, triple sum sets and their codes ⋮ On the classification of unitals on 28 points of low rank

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