Fundamental Bounds on Unequal Error Protection Codes
arxiv(2024)
摘要
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.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要