arXiv (All)
open access
Universal Decoding for Unequal Error Protection
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
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Linear Coding of LTI Sources Over Vector Gaussian Channels: A Majorization Approach#790268
- Insdel Reed-Solomon Decoding Algorithms up to the Half-Singleton Bound#1326663
- Empirical coordination in the finite blocklength regime: an achievability result---Extended version#1217462
- RPA Decoding with Few Subspace Projections for Correcting Structured Error Patterns in RM Codes#1327830
- A Public-Key-Dependent Adversarial-Deletion Ceiling for Fixed-Alphabet Multi-Bit Pseudorandom Codes#925326
Record · ID 1326673
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive