Achievability Bounds on Unequal Error Protection Codes
<|reference_start|>Achievability Bounds on Unequal Error Protection Codes: 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.<|reference_end|>
@article{yao2024achievability,
    title={Achievability Bounds on Unequal Error Protection Codes},
    author={Liuquan Yao, Shuai Yuan, Yuan Li, Huazi Zhang, Jun Wang, Guiying Yan,
  Zhiming Ma},
    journal={arXiv preprint arXiv:2405.03288},
    year={2024},
    archivePrefix={arXiv},
    eprint={2405.03288},
    primaryClass={cs.IT math.IT}
}