Achievability Bounds on Unequal Error Protection Codes
Lists
Only you see this
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.
BibTeX
@misc{yao2024achievability,
author = {Liuquan Yao and Shuai Yuan and Yuan Li and Huazi Zhang and Jun Wang and Guiying Yan and Zhiming Ma},
title = {{Achievability Bounds on Unequal Error Protection Codes}},
year = {2024},
eprint = {2405.03288},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2405.03288},
}Loading related content...