Infinite families of constacyclic codes supporting 3-designs and their applications in coding theory
Fuente:
arXiv
Guardado en:
| Autores principales: | , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2026
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866918487012671488 |
|---|---|
| author | Hu, Hongsheng Li, Nian Wu, Yanan Zeng, Xiangyong |
| author_facet | Hu, Hongsheng Li, Nian Wu, Yanan Zeng, Xiangyong |
| contents | Constacyclic codes over finite fields are of theoretical importance as they are closely related to a number of areas of mathematics such as algebra, algebraic geometry, graph theory,
combinatorial designs and number theory. However, the study of constacyclic codes in this context remains limited compared to classical cyclic codes. This paper provides two infinite families of $λ$-constacyclic codes over $\mathbb{F}_{q^2}$ that support infinite families of 3-designs, which generalize the results in [IEEE Trans. Inf. Theory 69(4): 2341-2354, 2023]. The parameters and weight distributions are determined completely. Besides, we study their subfield subcodes and applications on constructing entanglement-assisted quantum error-correcting codes (EAQECCs) and locally recoverable codes (LRCs). It is worthy to mention that two classes of maximal entanglement EAQECCs with a negative or a high positive net rate are derived. Moreover, two classes of distance-optimal and dimension-optimal LRCs are also obtained. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2605_05613 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Infinite families of constacyclic codes supporting 3-designs and their applications in coding theory Hu, Hongsheng Li, Nian Wu, Yanan Zeng, Xiangyong Information Theory Constacyclic codes over finite fields are of theoretical importance as they are closely related to a number of areas of mathematics such as algebra, algebraic geometry, graph theory, combinatorial designs and number theory. However, the study of constacyclic codes in this context remains limited compared to classical cyclic codes. This paper provides two infinite families of $λ$-constacyclic codes over $\mathbb{F}_{q^2}$ that support infinite families of 3-designs, which generalize the results in [IEEE Trans. Inf. Theory 69(4): 2341-2354, 2023]. The parameters and weight distributions are determined completely. Besides, we study their subfield subcodes and applications on constructing entanglement-assisted quantum error-correcting codes (EAQECCs) and locally recoverable codes (LRCs). It is worthy to mention that two classes of maximal entanglement EAQECCs with a negative or a high positive net rate are derived. Moreover, two classes of distance-optimal and dimension-optimal LRCs are also obtained. |
| title | Infinite families of constacyclic codes supporting 3-designs and their applications in coding theory |
| topic | Information Theory |
| url | https://arxiv.org/abs/2605.05613 |