Achievability Bounds on Unequal Error Protection 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_ | 1866917748103184384 |
|---|---|
| author | Yao, Liuquan Yuan, Shuai Li, Yuan Zhang, Huazi Wang, Jun Yan, Guiying Ma, Zhiming |
| author_facet | Yao, Liuquan Yuan, Shuai Li, Yuan Zhang, Huazi Wang, Jun Yan, Guiying Ma, Zhiming |
| contents | Unequal error protection (UEP) codes can facilitate the transmission of messages with different protection levels. In this paper, we study the achievability bounds on UEP by the generalization of Gilbert-Varshamov (GV) bound. For the first time, we show that under certain conditions, UEP enhances the code rate comparing with time-sharing (TS) strategies asymptotically. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2405_03288 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Achievability Bounds on Unequal Error Protection Codes Yao, Liuquan Yuan, Shuai Li, Yuan Zhang, Huazi Wang, Jun Yan, Guiying Ma, Zhiming Information Theory Unequal error protection (UEP) codes can facilitate the transmission of messages with different protection levels. In this paper, we study the achievability bounds on UEP by the generalization of Gilbert-Varshamov (GV) bound. For the first time, we show that under certain conditions, UEP enhances the code rate comparing with time-sharing (TS) strategies asymptotically. |
| title | Achievability Bounds on Unequal Error Protection Codes |
| topic | Information Theory |
| url | https://arxiv.org/abs/2405.03288 |