Achievability Bounds on Unequal Error Protection Codes
Abstract
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.
- Publication:
-
arXiv e-prints
- Pub Date:
- May 2024
- DOI:
- 10.48550/arXiv.2405.03288
- arXiv:
- arXiv:2405.03288
- Bibcode:
- 2024arXiv240503288Y
- Keywords:
-
- Computer Science - Information Theory
- E-Print:
- 9 pages, 4 figures