Additive codes from linear codes
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866913875022053376 |
|---|---|
| author | Ball, Simeon Popatia, Tabriz |
| author_facet | Ball, Simeon Popatia, Tabriz |
| contents | We introduce two constructions of additive codes over finite fields. Both constructions start with a linear code over a field with $q$ elements and give additive codes over the field with $q^h$ elements whose minimum distance is demonstrably good. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2506_03805 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Additive codes from linear codes Ball, Simeon Popatia, Tabriz Information Theory Combinatorics We introduce two constructions of additive codes over finite fields. Both constructions start with a linear code over a field with $q$ elements and give additive codes over the field with $q^h$ elements whose minimum distance is demonstrably good. |
| title | Additive codes from linear codes |
| topic | Information Theory Combinatorics |
| url | https://arxiv.org/abs/2506.03805 |