Achievability Bounds on Unequal Error Protection Codes
Reviewed by Pithpith:DXH5Z7FDopen to challenge →
classification
cs.IT
math.IT
keywords
protectionachievabilityboundscodeserrorunequalasymptoticallybound
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.