PreprintarXiv licencearXiv
Decoding Error Probability of the Random Code Ensemble over the Erasure Channel
Abstract
In this paper, we provide explicit formulas for the average decoding error probabilities of the ensemble of all (n,M)q codes over the erasure channel under unambiguous, list and maximum-likelihood decoding principles. Moreover, we derive the asymptotic error exponents for the ensemble of all (n,qRn)q codes.
Related
- An Upper Bound to the Undetected Error Exponent with Erasure Decoding at Positive Rates
- Joint Source-Channel Coding of Gaussian Sources over Block Erasure Channels: Nonasymptotic Bounds and Channel-Uniform Normal Approximations
- Block Erasure Channel and Block z-Channel with Bounded Decoders and Finite Blocklength
- Spatially Coupled MacKay-Neal/Hsu-Anastasopoulos CSS Codes Achieve the Quantum-Erasure Hashing Bound by Seeded BP Decoding
- Finite-blocklength classical communication over the quantum erasure channel with and without classical feedback
BibTeX
@misc{chan2026decoding,
title = {{Decoding Error Probability of the Random Code Ensemble over the Erasure Channel}},
author = {Chin Hei Chan},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.04688},
eprint = {2609.04688},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.04688},
}
RIS
TY - UNPB
TI - Decoding Error Probability of the Random Code Ensemble over the Erasure Channel
AU - Chin Hei Chan
PY - 2026
DA - 2026/09/04
PB - arXiv
DO - 10.48550/arxiv.2609.04688
UR - https://arxiv.org/abs/2609.04688
AB - In this paper, we provide explicit formulas for the average decoding error probabilities of the ensemble of all (n,M)_q codes over the erasure channel under unambiguous, list and maximum-likelihood decoding principles. Moreover, we derive the asymptotic error exponents for the ensemble of all (n,q^Rn)_q codes.
ER -