Photo from wikipedia
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.… Click to show full 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.
Keywords:
classification;
linear codes;
classification linear;
computer classification
Journal Title: IEEE Transactions on Information Theory
Year Published: 2021
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!
Journal Title: IEEE Transactions on Information Theory
Year Published: 2021
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!