Achievability Bounds on Unequal Error Protection Codes
Liuquan Yao, Shuai Yuan, Yuan Li, Huazi Zhang, Jun Wang, Guiying Yan,, Zhiming Ma
TL;DR
This paper establishes achievability bounds for unequal error protection codes, demonstrating that under certain conditions, UEP can asymptotically outperform time-sharing strategies in terms of code rate.
Contribution
It generalizes the Gilbert-Varshamov bound to UEP codes and shows that UEP can asymptotically improve code rate over time-sharing.
Findings
UEP can outperform time-sharing asymptotically
Generalization of Gilbert-Varshamov bound to UEP
Conditions under which UEP enhances code rate
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSoftware Reliability and Analysis Research · Formal Methods in Verification · Radiation Effects in Electronics