Channel Resolvability Using Multiplicative Weight Update Algorithm
Fuente:
arXiv
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866909714824036352 |
|---|---|
| author | Takahashi, Koki Watanabe, Shun |
| author_facet | Takahashi, Koki Watanabe, Shun |
| contents | We study the channel resolvability problem, which is used to prove strong converse of identification via channel. Channel resolvability has been solved by only random coding in the literature. We prove channel resolvability using the multiplicative weight update algorithm. This is the first approach to channel resolvability using non-random coding. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2501_11881 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Channel Resolvability Using Multiplicative Weight Update Algorithm Takahashi, Koki Watanabe, Shun Information Theory We study the channel resolvability problem, which is used to prove strong converse of identification via channel. Channel resolvability has been solved by only random coding in the literature. We prove channel resolvability using the multiplicative weight update algorithm. This is the first approach to channel resolvability using non-random coding. |
| title | Channel Resolvability Using Multiplicative Weight Update Algorithm |
| topic | Information Theory |
| url | https://arxiv.org/abs/2501.11881 |