at Google ScholarTitle data
Bouyukliev, Iliya ; Bouyuklieva, Stefka ; Kurz, Sascha:
Computer classification of linear codes.
In: IEEE Transactions on Information Theory.
Vol. 67
(2021)
Issue 12
.
- pp. 7807-7814.
ISSN 0018-9448
DOI: https://doi.org/10.1109/TIT.2021.3114280
Abstract in another language
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.
Further data
| Item Type: | Article in a journal |
|---|---|
| Refereed: | Yes |
| Keywords: | linear code; classification; enumeration; code equivalence; lattice point enumeration; canonical augmentation |
| Subject classification: | Mathematics Subject Classification Code: 94B05 (05E20) |
| Institutions of the University: | Faculties > Faculty of Mathematics, Physics und Computer Science Faculties > Faculty of Mathematics, Physics und Computer Science > Department of Mathematics Faculties > Faculty of Mathematics, Physics und Computer Science > Department of Mathematics > Chair Mathematical Economics Faculties |
| Result of work at the UBT: | Yes |
| DDC Subjects: | 000 Computer Science, information, general works > 004 Computer science 500 Science > 510 Mathematics |
| Date Deposited: | 22 Nov 2021 12:40 |
| Last Modified: | 15 Feb 2022 12:41 |
| URI: | https://eref.uni-bayreuth.de/id/eprint/67961 |