More MDS codes of non-Reed-Solomon type
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2024
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866916083441598464 |
|---|---|
| author | Wu, Yansheng Heng, Ziling Li, Chengju Ding, Cunsheng |
| author_facet | Wu, Yansheng Heng, Ziling Li, Chengju Ding, Cunsheng |
| contents | MDS codes have diverse practical applications in communication systems, data storage, and quantum codes due to their algebraic properties and optimal error-correcting capability. In this paper, we focus on a class of linear codes and establish some sufficient and necessary conditions for them being MDS. Notably, these codes differ from Reed-Solomon codes up to monomial equivalence. Additionally, we also explore the cases in which these codes are almost MDS or near MDS. Applying our main results, we determine the covering radii and deep holes of the dual codes associated with specific Roth-Lempel codes and discover an infinite family of (almost) optimally extendable codes with dimension three. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2401_03391 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | More MDS codes of non-Reed-Solomon type Wu, Yansheng Heng, Ziling Li, Chengju Ding, Cunsheng Information Theory Combinatorics MDS codes have diverse practical applications in communication systems, data storage, and quantum codes due to their algebraic properties and optimal error-correcting capability. In this paper, we focus on a class of linear codes and establish some sufficient and necessary conditions for them being MDS. Notably, these codes differ from Reed-Solomon codes up to monomial equivalence. Additionally, we also explore the cases in which these codes are almost MDS or near MDS. Applying our main results, we determine the covering radii and deep holes of the dual codes associated with specific Roth-Lempel codes and discover an infinite family of (almost) optimally extendable codes with dimension three. |
| title | More MDS codes of non-Reed-Solomon type |
| topic | Information Theory Combinatorics |
| url | https://arxiv.org/abs/2401.03391 |