The reviewed record of science sign in
Pith

arxiv: 2405.03288 · v3 · pith:DXH5Z7FD · submitted 2024-05-06 · cs.IT · math.IT

Achievability Bounds on Unequal Error Protection Codes

Liuquan Yao , Shuai Yuan , Yuan Li , Huazi Zhang , Jun Wang , Guiying Yan , Zhiming Ma This is my paper

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:DXH5Z7FDrecord.jsonopen to challenge →

classification cs.IT math.IT
keywords protectionachievabilityboundscodeserrorunequalasymptoticallybound
0
0 comments X
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.