Computer classification of linear codes based on lattice point enumeration and integer linear programming
Fuente:
arXiv
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2024
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866915156062109696 |
|---|---|
| author | Kurz, Sascha |
| author_facet | Kurz, Sascha |
| contents | Linear codes play a central role in coding theory and have applications in several branches of mathematics. For error correction purposes the minimum Hamming distance should be as large as possible. Linear codes related to applications in Galois Geometry often require a certain divisibility of the occurring weights. In this paper we present an algorithmic framework for the classification of linear codes over finite fields with restricted sets of weights. The underlying algorithms are based on lattice point enumeration and integer linear programming. We present new enumeration and non-existence results for projective two-weight codes, divisible codes, and additive $\mathbb{F}_4$-codes. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2403_17509 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Computer classification of linear codes based on lattice point enumeration and integer linear programming Kurz, Sascha Information Theory Combinatorics 94B05, 05E20 Linear codes play a central role in coding theory and have applications in several branches of mathematics. For error correction purposes the minimum Hamming distance should be as large as possible. Linear codes related to applications in Galois Geometry often require a certain divisibility of the occurring weights. In this paper we present an algorithmic framework for the classification of linear codes over finite fields with restricted sets of weights. The underlying algorithms are based on lattice point enumeration and integer linear programming. We present new enumeration and non-existence results for projective two-weight codes, divisible codes, and additive $\mathbb{F}_4$-codes. |
| title | Computer classification of linear codes based on lattice point enumeration and integer linear programming |
| topic | Information Theory Combinatorics 94B05, 05E20 |
| url | https://arxiv.org/abs/2403.17509 |