Generalized graph codes and thier minimum distances
Fuente:
arXiv
Guardado en:
| Autor principal: | |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866917901400801280 |
|---|---|
| author | Fujii, Naoki |
| author_facet | Fujii, Naoki |
| contents | Graph code is a linear code obtained from linear codes $C$ and a certain bipartite graph G. In this paper, I propose an expansion of the definition of graph code to general $l$-partite, and give its lower bound of minimum distance. I also give an example of generalized graph code and calculate its parameters $[n, k, d]$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2501_13462 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Generalized graph codes and thier minimum distances Fujii, Naoki Combinatorics Information Theory Graph code is a linear code obtained from linear codes $C$ and a certain bipartite graph G. In this paper, I propose an expansion of the definition of graph code to general $l$-partite, and give its lower bound of minimum distance. I also give an example of generalized graph code and calculate its parameters $[n, k, d]$. |
| title | Generalized graph codes and thier minimum distances |
| topic | Combinatorics Information Theory |
| url | https://arxiv.org/abs/2501.13462 |