A family of linear codes that are either non-GRS MDS codes or NMDS codes
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912204379389952 |
|---|---|
| author | Li, Yang Sun, Zhonghua Zhu, Shixin |
| author_facet | Li, Yang Sun, Zhonghua Zhu, Shixin |
| contents | Both maximum distance separable (MDS) codes that are not equivalent to generalized Reed-Solomon (GRS) codes (non-GRS MDS codes) and near MDS (NMDS) codes have nice applications in communication and storage systems. In this paper, we introduce and study a new family of linear codes involving their parameters, weight distributions, and self-orthogonal properties. We prove that such codes are either non-GRS MDS codes or NMDS codes, and hence, they can produce as many of the desired codes as possible. We also completely determine their weight distributions with the help of the solutions to some subset sum problems. A sufficient and necessary condition for such codes to be self-orthogonal is characterized. Based on this condition, we further deduce that there are no self-dual codes in this class of linear codes and explicitly construct two new classes of almost self-dual codes. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2401_04360 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | A family of linear codes that are either non-GRS MDS codes or NMDS codes Li, Yang Sun, Zhonghua Zhu, Shixin Information Theory Both maximum distance separable (MDS) codes that are not equivalent to generalized Reed-Solomon (GRS) codes (non-GRS MDS codes) and near MDS (NMDS) codes have nice applications in communication and storage systems. In this paper, we introduce and study a new family of linear codes involving their parameters, weight distributions, and self-orthogonal properties. We prove that such codes are either non-GRS MDS codes or NMDS codes, and hence, they can produce as many of the desired codes as possible. We also completely determine their weight distributions with the help of the solutions to some subset sum problems. A sufficient and necessary condition for such codes to be self-orthogonal is characterized. Based on this condition, we further deduce that there are no self-dual codes in this class of linear codes and explicitly construct two new classes of almost self-dual codes. |
| title | A family of linear codes that are either non-GRS MDS codes or NMDS codes |
| topic | Information Theory |
| url | https://arxiv.org/abs/2401.04360 |