Reproduce “Achievability Bounds on Unequal Error Protection Codes” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Liuquan Yao, Shuai Yuan, Yuan Li, Huazi Zhang, Jun Wang, Guiying Yan, Zhiming Ma
The authors generalize the Gilbert–Varshamov bound to binary unequal-error-protection codes, where two message sets require different minimum Hamming distances. Their construction clusters the less-protected codewords and uses overlap among excluded regions to fit additional, more-protected codewords. Under stated conditions, it achieves an exponentially larger high-protection message set than the specified GV time-sharing baseline, yielding a positive asymptotic rate gap.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.