Classification of linear codes using canonical augmentation

2019/07/24 by Iliya Bouyukliev, Bouyukliev, Iliya, Stefka Bouyuklieva +1 · 2 citations
Computer Science · Engineering · Mathematics · #05E18 #94B05 #Coding theory and cryptography #Combinatorics (math.CO) #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #Error Correcting Code Techniques #FOS: Computer and information sciences #FOS: Mathematics #cs.DM #cs.DS #graph theory and CDMA systems #math.CO #msc:05E18 #msc:94B05

paper · pdf · doi:10.48550/arxiv.1907.10363

arxiv created 2019/07/24 · openalex publication_date 2019/07/24 · arxiv updated 2019/07/25 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We propose an algorithm for classification of linear codes over different finite fields based on canonical augmentation. We apply this algorithm to obtain classification results over fields with 2, 3 and 4 elements.

Cited by

• LinCode -- computer classification of linear codes
• Computer classification of linear codes

Related

• LinCode -- computer classification of linear codes
• Computer classification of linear codes based on lattice point enumeration and integer linear programming
• It is indeed a fundamental construction of all linear codes
• Additive codes from linear codes
• Two families of linear codes with desirable properties from some functions over finite fields