New record-breaking binary linear codes constructed from group codes
Fuente:
arXiv
Guardado en:
| Autores principales: | , , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866913620845133824 |
|---|---|
| author | Yu, Cong Zhu, Shixin Chen, Hao Li, Yang Zhang, Xiuyu |
| author_facet | Yu, Cong Zhu, Shixin Chen, Hao Li, Yang Zhang, Xiuyu |
| contents | In this paper, we employ group rings and automorphism groups of binary linear codes to construct new record-breaking binary linear codes. We consider the semidirect product of abelian groups and cyclic groups and use these groups to construct linear codes. Finally, we obtain some linear codes which have better parameters than the code in \cite{bib5}. All the calculation results and corresponding data are listed in the paper or posted online. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2412_15551 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | New record-breaking binary linear codes constructed from group codes Yu, Cong Zhu, Shixin Chen, Hao Li, Yang Zhang, Xiuyu Information Theory In this paper, we employ group rings and automorphism groups of binary linear codes to construct new record-breaking binary linear codes. We consider the semidirect product of abelian groups and cyclic groups and use these groups to construct linear codes. Finally, we obtain some linear codes which have better parameters than the code in \cite{bib5}. All the calculation results and corresponding data are listed in the paper or posted online. |
| title | New record-breaking binary linear codes constructed from group codes |
| topic | Information Theory |
| url | https://arxiv.org/abs/2412.15551 |