Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2406.13355 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913398140174336 |
|---|---|
| author | Martínez-Peñas, Umberto Rodríguez-Ballesteros, Rubén |
| author_facet | Martínez-Peñas, Umberto Rodríguez-Ballesteros, Rubén |
| contents | In this work, we study linear codes with the folded Hamming distance, or equivalently, codes with the classical Hamming distance that are linear over a subfield. This includes additive codes. We study MDS codes in this setting and define quasi MDS (QMDS) codes and dually QMDS codes, which attain a more relaxed variant of the classical Singleton bound. We provide several general results concerning these codes, including restriction, shortening, weight distributions, existence, density, geometric description and bounds on their lengths relative to their field sizes. We provide explicit examples and a binary construction with optimal lengths relative to their field sizes, which beats any MDS code. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2406_13355 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Linear codes in the folded Hamming distance and the quasi MDS property Martínez-Peñas, Umberto Rodríguez-Ballesteros, Rubén Information Theory In this work, we study linear codes with the folded Hamming distance, or equivalently, codes with the classical Hamming distance that are linear over a subfield. This includes additive codes. We study MDS codes in this setting and define quasi MDS (QMDS) codes and dually QMDS codes, which attain a more relaxed variant of the classical Singleton bound. We provide several general results concerning these codes, including restriction, shortening, weight distributions, existence, density, geometric description and bounds on their lengths relative to their field sizes. We provide explicit examples and a binary construction with optimal lengths relative to their field sizes, which beats any MDS code. |
| title | Linear codes in the folded Hamming distance and the quasi MDS property |
| topic | Information Theory |
| url | https://arxiv.org/abs/2406.13355 |