Capacity of an infinite family of networks related to the diamond network for fixed alphabet sizes
Fuente:
arXiv
Guardado en:
| Autor principal: | |
|---|---|
| Formato: | Preprint |
| Publicado: |
2022
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866912034266808320 |
|---|---|
| author | Kurz, Sascha |
| author_facet | Kurz, Sascha |
| contents | We consider the problem of error correction in a network where the errors can occur only on a proper subset of the network edges. For a generalization of the so-called Diamond Network we consider lower and upper bounds for the network's (1-shot) capacity for fixed alphabet sizes. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2212_00060 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | Capacity of an infinite family of networks related to the diamond network for fixed alphabet sizes Kurz, Sascha Information Theory 94B65 We consider the problem of error correction in a network where the errors can occur only on a proper subset of the network edges. For a generalization of the so-called Diamond Network we consider lower and upper bounds for the network's (1-shot) capacity for fixed alphabet sizes. |
| title | Capacity of an infinite family of networks related to the diamond network for fixed alphabet sizes |
| topic | Information Theory 94B65 |
| url | https://arxiv.org/abs/2212.00060 |