Skip to content
DraconiticResearch
Search Sources API
201,818 studies31 sourcesUpdated 59 min ago
PreprintCC BY-NC-ND 4.0arXiv

Universal Decoding for Unequal Error Protection

Abstract

We study universal unequal error protection of a single special message over discrete memoryless channels. We construct a sequence of codes with a decoding rule that does not depend on the channel transition law. We derive an achievable error exponent for the special message while ensuring reliable decoding of the ordinary messages. The resulting exponent strictly improves on the natural equal-error-protection random-coding baseline and remains positive as the rate approaches capacity. For symmetric channels, it converges to the optimal red-alert exponent at capacity.

Related

  1. Universal Decoding via the Pairwise Error Probability
    Nir Elkayam, Meir Feder
    arXivPreprintarXiv licenceFull textGeneral mathematicsarXiv
  2. Decoding Error Probability of the Random Code Ensemble over the Erasure Channel
    Chin Hei Chan
    arXivPreprintarXiv licenceFull textGeneral mathematicsarXiv
  3. An Upper Bound to the Undetected Error Exponent with Erasure Decoding at Positive Rates
    Seyed AmirPouya Moeini, Marco Dalai, Albert Guillén i Fàbregas
    arXivPreprintCC BY-NC-SA 4.0Full textGeneral mathematicsarXiv
  4. Error-correction Decoding for 2D Convolutional Codes with a Generalized Viterbi Algorithm
    Zita Abreu, Elisa Junghans, Julia Lieb +1
    arXivPreprintCC BY-SA 4.0Full textDynamical systemsarXiv
  5. RPA Decoding with Few Subspace Projections for Correcting Structured Error Patterns in RM Codes
    Shiv Pratap Singh Rathore, Navin Kashyap
    arXivPreprintarXiv licenceFull textGeneral mathematicsarXiv
BibTeX
@misc{moeini2026universal,
  title = {{Universal Decoding for Unequal Error Protection}},
  author = {Seyed AmirPouya Moeini and Albert Guillén i Fàbregas},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.15423},
  eprint = {2610.15423},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.15423},
  note = {CC BY-NC-ND 4.0},
}
RIS
TY  - UNPB
TI  - Universal Decoding for Unequal Error Protection
AU  - Seyed AmirPouya Moeini
AU  - Albert Guillén i Fàbregas
PY  - 2026
DA  - 2026/10/11
PB  - arXiv
DO  - 10.48550/arxiv.2610.15423
UR  - https://arxiv.org/abs/2610.15423
AB  - We study universal unequal error protection of a single special message over discrete memoryless channels. We construct a sequence of codes with a decoding rule that does not depend on the channel transition law. We derive an achievable error exponent for the special message while ensuring reliable decoding of the ordinary messages. The resulting exponent strictly improves on the natural equal-error-protection random-coding baseline and remains positive as the rate approaches capacity. For symmetric channels, it converges to the optimal red-alert exponent at capacity.
ER  -