Computer Classification of Linear Codes
Iliya Bouyukliev, Stefka Bouyuklieva, Sascha Kurz
Abstract
Two algorithms for the classification of linear codes over finite fields are presented. One of the algorithms is based on canonical augmentation and the other one on lattice point enumeration. New classification results over fields with 2, 3 and 4 elements are obtained.
Topics & Concepts
EnumerationFinite fieldComputer scienceStatistical classificationLattice (music)AlgorithmClassification schemeLinear codePoint (geometry)Theoretical computer scienceBlock codeMathematicsArtificial intelligenceDiscrete mathematicsMachine learningDecoding methodsPhysicsAcousticsGeometryCoding theory and cryptographyCryptography and Data Securitygraph theory and CDMA systems