Decoding error probability of random parity-check matrix ensemble over the erasure channel
Guardado en:
| Publicado en: | Designs, Codes, and Cryptography vol. 93, no. 1 (Jan 2025), p. 51 |
|---|---|
| Autor principal: | |
| Otros Autores: | , |
| Publicado: |
Springer Nature B.V.
|
| Materias: | |
| Acceso en línea: | Citation/Abstract Full Text Full Text - PDF |
| Etiquetas: |
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| Resumen: | In this paper we carry out an in-depth study on the average decoding error probability of the random parity-check matrix ensemble over the erasure channel under three decoding principles, namely unambiguous decoding, maximum likelihood decoding and list decoding. We obtain explicit formulas for the average decoding error probabilities of the random parity-check matrix ensemble under these three decoding principles and compute the error exponents. Moreover, for unambiguous decoding, we compute the variance of the decoding error probability of the random parity-check matrix ensemble and the error exponent of the variance, which implies a strong concentration result, that is, roughly speaking, the ratio of the decoding error probability of a random linear code in the ensemble and the average decoding error probability of the ensemble converges to 1 with high probability when the code length goes to infinity. |
|---|---|
| ISSN: | 0925-1022 1573-7586 |
| DOI: | 10.1007/s10623-024-01516-5 |
| Fuente: | Advanced Technologies & Aerospace Database |