Group actions on codes in graphs
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_ | 1866909253805015040 |
|---|---|
| author | Hawtin, Daniel R. Praeger, Cheryl E. |
| author_facet | Hawtin, Daniel R. Praeger, Cheryl E. |
| contents | This is a chapter in a forthcoming book on completely regular codes in distance regular graphs. The chapter provides an overview, and some original results, on codes in distance regular graphs which admit symmetries via a permutation group acting on the vertices of the graph. The strongest notion of completely transitive codes is developed, as well as the more general notion of neighbour-transitive codes. The graphs considered are the Hamming, Johnson, and Kneser graphs and their q-analogues, as well as some graphs related to incidence structures. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2407_09803 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Group actions on codes in graphs Hawtin, Daniel R. Praeger, Cheryl E. Combinatorics Information Theory 05E18 (Primary) 94B99 (Secondary) This is a chapter in a forthcoming book on completely regular codes in distance regular graphs. The chapter provides an overview, and some original results, on codes in distance regular graphs which admit symmetries via a permutation group acting on the vertices of the graph. The strongest notion of completely transitive codes is developed, as well as the more general notion of neighbour-transitive codes. The graphs considered are the Hamming, Johnson, and Kneser graphs and their q-analogues, as well as some graphs related to incidence structures. |
| title | Group actions on codes in graphs |
| topic | Combinatorics Information Theory 05E18 (Primary) 94B99 (Secondary) |
| url | https://arxiv.org/abs/2407.09803 |