The error-correcting pair for several classes of NMDS linear codes
Fuente:
arXiv
Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866908399307849728 |
|---|---|
| author | He, Dong Zhang, Zhaohui Liao, Qunying |
| author_facet | He, Dong Zhang, Zhaohui Liao, Qunying |
| contents | The error-correcting pair is a general algebraic decoding method for linear codes. The near maximal distance separable (NMDS) linear code is a subclass of linear codes and has applications in secret sharing scheme and communication systems due to the efficient performance, thus we focus on the error-correcting pair of NMDS linear codes. In 2023, He and Liao showed that for an NMDS linear code $\mathcal{C}$ with minimal distance $2\ell+1$ or $2\ell+2$, if $\mathcal{C}$ has an $\ell$-error-correcting pair $\left( \mathcal{A}, \mathcal{B} \right)$, then the parameters of $\mathcal{A}$ have 6 or 10 possibilities, respectively.
In this manuscript, basing on Product Singleton Bound, we give several necessary conditions for that the NMDS linear code $\mathcal{C}$ with minimal distance $2\ell+1$ has an $\ell$-error-correcting pair $(\mathcal{A}, \mathcal{B})$, where the parameters of $\mathcal{A}$ is the 1st, 2nd, 4th or 5th case, then basing on twisted generalized Reed-Solomon codes, we give an example for that the parameters of $\mathcal{A}$ is the 1st case. Moreover, we also give several necessary conditions for that the NMDS linear code $\mathcal{C}$ with minimal distance $2\ell+2$ has an $\ell$-error-correcting pair $(\mathcal{A}, \mathcal{B})$, where the parameters of $\mathcal{A}$ is the 2nd, 4th, 7th or 8th case, then we give an example for that the parameters of $\mathcal{A}$ is the 1st or 2nd case, respectively. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2506_07380 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | The error-correcting pair for several classes of NMDS linear codes He, Dong Zhang, Zhaohui Liao, Qunying Information Theory 94A24, 94B05 The error-correcting pair is a general algebraic decoding method for linear codes. The near maximal distance separable (NMDS) linear code is a subclass of linear codes and has applications in secret sharing scheme and communication systems due to the efficient performance, thus we focus on the error-correcting pair of NMDS linear codes. In 2023, He and Liao showed that for an NMDS linear code $\mathcal{C}$ with minimal distance $2\ell+1$ or $2\ell+2$, if $\mathcal{C}$ has an $\ell$-error-correcting pair $\left( \mathcal{A}, \mathcal{B} \right)$, then the parameters of $\mathcal{A}$ have 6 or 10 possibilities, respectively. In this manuscript, basing on Product Singleton Bound, we give several necessary conditions for that the NMDS linear code $\mathcal{C}$ with minimal distance $2\ell+1$ has an $\ell$-error-correcting pair $(\mathcal{A}, \mathcal{B})$, where the parameters of $\mathcal{A}$ is the 1st, 2nd, 4th or 5th case, then basing on twisted generalized Reed-Solomon codes, we give an example for that the parameters of $\mathcal{A}$ is the 1st case. Moreover, we also give several necessary conditions for that the NMDS linear code $\mathcal{C}$ with minimal distance $2\ell+2$ has an $\ell$-error-correcting pair $(\mathcal{A}, \mathcal{B})$, where the parameters of $\mathcal{A}$ is the 2nd, 4th, 7th or 8th case, then we give an example for that the parameters of $\mathcal{A}$ is the 1st or 2nd case, respectively. |
| title | The error-correcting pair for several classes of NMDS linear codes |
| topic | Information Theory 94A24, 94B05 |
| url | https://arxiv.org/abs/2506.07380 |